(a) Draw the BST where the data value at each node is an integer and the values are entered in the following order: 36, 22, 10, 44, 42, 60, 50, 70, 80, 85, 75, 55, 45 (d) What is the height of the tree of part (a)? (e) Draw the BST on the following data 40, 30, 50, 20, 35, 45, 60, 25, 33, 42, 65. Now draw its mirror image BST Mirror of BST (1) Display the tree constructed in (e) using Breadth First Search or level order traversal. i.e. the BFS of above tree is given as a 5 3 7 1 4 8 (g) Given the In-Order {10 20 25 30 40 45 60} and Pre-Order {40 20 10 300 25 60 45}. Draw the original BST. Search yourself. (h) Given the In-Order {10 20 25 30 40 45 60} and Post-Order {10 25 30 20 45 60 40}. Draw the original BST. Search yourself.

(a) Draw the BST where the data value at each node is an integer and the values are entered in the following order: 36, 22, 10, 44, 42, 60, 50, 70, 80, 85, 75, 55, 45 (d) What is the height of the tree of part (a)? (e) Draw the BST on the following data 40, 30, 50, 20, 35, 45, 60, 25, 33, 42, 65. Now draw its mirror image BST Mirror of BST (1) Display the tree constructed in (e) using Breadth First Search or level order traversal. i.e. the BFS of above tree is given as a 5 3 7 1 4 8 (g) Given the In-Order {10 20 25 30 40 45 60} and Pre-Order {40 20 10 300 25 60 45}. Draw the original BST. Search yourself. (h) Given the In-Order {10 20 25 30 40 45 60} and Post-Order {10 25 30 20 45 60 40}. Draw the original BST. Search yourself.

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

What is the level of node 17, and node 11, respectively? Insert integers 11, 22, 15, 44, 6, 9, 3, 33, 17, 5 into a BST in that order. Draw the final tree. From the BST, delete node with 3, and then delete the node with 22, respectively; Then insert a node with 18 into the BST. Draw the final tree after above operations are finished.
Postorder: 7 6 8 5 2 9 4 10 3 1 Inorder: 6 7 2 5 8 1 4 9 3 10 After drawing the tree, at what level does node 10 belongs? (Numeric Answer ONLY)
Insert the following values into an initially empty Red-Black tree in the order given.Insert: 93, 85, 24, 13, 47, 59, 18, 36, 14, 35, 77, 63 Also, answer the questions below.What is the black-height of node 59?What is the height of node 24?
Build an AVL tree with the following values: 15, 20, 24, 10, 13, 7, 30, 36, 25
a) Show all the steps in creating a Red-Black tree by inserting the following sequentialy, 25, 33, 12,46,19,16,17 and 25. b) After creating the Red-Black tree as indicated above, delete the node representing 19 and display the RedBlack tree Show everything step by step please
Insert the following key values one by one into an empty AVL tree. Restore tree as needed during the process. After the tree is built, show the post order traversal result in terms of the order of the key values visited. 30 45 65 55 50 52
Postorder: 7 6 8 5 2 9 4 10 3 1 Inorder: 6 7 2 5 8 1 4 9 3 10 After drawing the tree, what/who is the parent node of node 8? (Numeric Answer ONLY)
A completely full B Tree with n=4, l=10 and height=2 (has levels 0, 1, 2) can have how many unique keys (Assume unique values are inserted)? Assume 0 based height. A tree with a single root node has a height = 0. n = maximum children a node can have l = maximum keys a node can have What is the maximum number of unique keys that it can hold? Calculate and give you answer here: _______
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.
Please draw the following:Form a binary tree with the root node holding 20, the left and right child of the node holding 20 respectively holding 75 and 43. The next level nodes hold the data 84, 90, 57 and 71 from left to right. The node holding 84 has left and right children that respectively hold 96 and 91 and the node holding 90 has a left child that holds 93.
The following Program in java implements a BST. The BST node (TNode) contains a data part as well as two links to its right and left children. 1. Draw (using paper and pen) the BST that results from the insertion of the values 60,30, 20, 80, 15, 70, 90, 10, 25, 33 (in this order). These values are used by the program 2. Traverse the tree using preorder, inorder and postorder algorithms (using paper and pen) 3. Write the program in c++, follow its steps, then compile and run. - Compare the results to what you obtained in (2) above. - Try different values class TestBST{public static void main(String []args){int i;int x[] = {60,30, 20, 80, 15, 70, 90, 10, 25, 33};BST t = new BST();for (i=0; i < 10; i++){System.out.print(" Adding: "+x[i]+" to the BST ");t.insert(x[i]);}System.out.println("\nPreorder traversal result:");t.preorder(t.root);System.out.println("\nInorder traversal result:");t.inorder(t.root);System.out.println("\nPostorder traversal result:");t.postorder(t.root);}}class…
Insert the following keys into AVL tree: 50,20,60,10,8,15,32,46,11,48Hint: you must preserve the property of AVL after you insert each element. The property of AVLis a balanced binary tree such that each node has a balance factor in the range of 0,1,-1. Youmust show the balanced factor for each node after you insert a new element.