Question 1: Given the numbers 80 12 46 78 11 60 9 10 13 20 92, insert each data element in its proper node and draw the binary search tree. Question 2: Use your binary tree in Question 1 to list the nodes sequence for the following traversals: a. Preorder traversal b. Postorder traversal c. Inorder traversal. Question 3: Redraw your tree in Question 1 after deleting node 46.

Question 1: Given the numbers 80 12 46 78 11 60 9 10 13 20 92, insert each data element in its proper node and draw the binary search tree. Question 2: Use your binary tree in Question 1 to list the nodes sequence for the following traversals: a. Preorder traversal b. Postorder traversal c. Inorder traversal. Question 3: Redraw your tree in Question 1 after deleting node 46.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Create a binary search tree using the following insertions. 55, 44, 66, 99, 88, 22, 77, 33, 25, 75 Based on the final tree, what is the postorder traversal of the tree? (Ensure that there is A SPACE between each number)
Create a binary search tree using the following insertions.44, 88, 55, 77, 33, 99, 66, 22, 25, 75Based on the final tree, what is the postorder traversal of the tree?
Create a binary search tree using the following insertions. 55, 44, 66, 99, 88, 22, 77, 33, 25, 75 Based on the final tree, what is the inorder traversal of the tree?
Given the following binary tree in the picture (where nullptr height == -1):A. What is the height of the tree?B. What is the depth of node 90?C. What is the height of node 90?D. Give the pre-order, in-order, and post-order traversal of this tree
Question 1 When a binary search tree is balanced, it provides O(log2N) search, addition, and removal. True False Question 2 A depth-first traversal of a tree is also known as a level-order traversal. True False Question 3 Our BSTNode class is a self-referential class. True False Question 4 The contains method of our binary search tree examines every node in the tree before returning a result of false. True False Question 5 When a binary search tree is balanced, it provides O(N2) search, addition, and removal. True False Question 6 The number of nodes in a non-empty tree is equal to the number of nodes in its left subtree plus the number of nodes in its right subtree True False Question 7 A tree node's unique predecessor is its parent. True False Question 8 A tree node and all of its descendants form a subtree that is rooted at the node. True False Question 9 The number of different binary trees that can be made from 2 nodes that contain the key values 3 and 6 is 2.…
Traversal 1. Draw the binary search tree that results from inserting the numbers below starting with 70 and ending with 62. (70 11 47 81 20 61 10 12 13 62)2. For the tree above, list the nodes in a preorder, postorder and inorder traversalPreorder: Postorder:Inorder:3. Redraw tree after deleting 11
(a) You have an empty binary search tree. After that, you do the following sequence of insertions:20, 30, 10, 50, 40, 60. Draw the status of the binary search tree after the first 3 insertions, and at the endof all 6 insertions (you only need to show 2 trees). (b) Start now with a binary search tree with a single node containing an unknown key X. You mustchoose the value X so that if you later add the 6 keys in question 1(a) in the same order, you get aperfect tree with 7 nodes. Give a value for X and show the final tree obtained.
Question 9 The number of different binary trees that can be made from 2 nodes that contain the key values 3 and 6 is 2. True False Question 10 Suppose xOrder is one of our binary search tree traversal methods that is passed a tree node, node, and a queue, q. Which traversal order is provided by the following code? xOrder(node.getLeft(), q); xOrder(node.getRight(), q); q.enqueue(node.getInfo()); preorder levelorder inorder postorder None of these is correct.
1.Suppose that we first insert an element x into a binary search tree that does not already contain x. Suppose that we then immediately delete x from the tree. Will the new tree be identical to the original one? If yes, please justify your answers with no more that 3 sentences. If no, please give a counterexample. You may draw pictures if need 2. Draw pictures to show how to construct a red-black tree by inserting the keys in the following sequence into an initially empty red-black tree: 8, 4,10, 9, 5, 17. Show each steps. Please use a double edge indicates a red pointer and single edge indicates a black pointer.
Show the result of inserting 30, 10, 40, 60, 90, 20, 50, 70 into an initially empty binary search tree. b) Is the above tree a full binary tree? Why? Why not? c)Draw the subtree with the root node as 60.
Q#1. Draw the Binary and Binary search tree for the following values, and traverse the Binary Search tree in Post, Pre and Inorder.? 100,29,45,120,12,45,140,100,45,150,45,67,89,100,650 Q#2. Convert the following expression into the Prefix and Postfix mentioned notation? And draw their trees. a> a + b + c - d * x / y b> x*(y - a) + (s + t * d)
1- Evaluate the following postfix expression of tree ABC*D/+ where A=2 B=3 C=4 D=6 2- What is a Binary Search Tree (BST)? Show the structure of the binary search tree after adding each ofthe following values in that order: 10, 25, 2, 4, 7, 13, 11, 22. What is the height of the created binarysearch tree?3- Construct a BST for the following numbers: 47, 55, 23, 17, 39, 11, 50, 9, 19, 74, 33, 28Show all the steps. Write its preorder traversal.