(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

[9] Instructions: Kindly provide the complete and correct solutions. I won't like it if it is incomplete and incorrect.
Exercise #1 If you insert 42, 62 and 82 respectively into the following binary search tree what tree do you get 60 (40 (70 (25 65 (80
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 (
If Treel and Tree2 are the trees indicated below, B F) H Tree2 Treel which traversals of Treel and Tree2, respectively, will produce the same sequence of node names? Preorder, postorder Postorder, inorder Postorder, postorder Inorder, inorder Postorder, preorder
What is a child node?
Insert the value "8" into the following Red-Black tree; draw the result.Use Double-circle to denote red nodes and single circle to denote black nodes.
46. Inorder traversal: Visit the left subtree, then the node, then the right subtree. True False Question 47 47. Postorder traversal: Visit each node after visiting its children. True False
Each node that is spread out has more than one copy of the code. What is it?
Q1/ You have an array representation of tree with the following data in array (T) that are starting from location Zero (T[0]) 44, 13, 52, 33, 67, 22, 56, 11, 19. (1) Draw the corresponding tree, showing the rules. (2) What is the depth of the tree? (3) What is the maximum size of array (T)? (4) Who is the parent of the node of value (22)? C12/ Use the following data to build Min Heap Tree? 35, 92, 23, 74, 13, 11. Then insert 17. Q3/ 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 give the reason in no more than 3 sentences. If no give an example. Draw pictures if you necessary. Q4/ Consider the directed graph G1 with the set of vertices (A; B;C; D; Eg and eight weighted edges, given by the following triples: (A; B; 9); (A;C; 2); (A; D; 6); (C; D; 3); (C; E; 1); (D; B; 2); (E; B; 3); (E; D; 1): For example, the triple…
Describe the two parts of a node.
C++ Sketch a left rotation on an AVL. build the following AVL tree: insert 5insert 2insert 7insert 9insert 11 follow the insert algorithm draw out the original tree prior to any rotations-which node breaks the avl condition-label N, R, A, B, C, and the parent of N.-draw out the final tree after any rotation
6. Insert a Node with key 51 into the following AVL tree and draw the tree after performing all rotations. 30 50 52 55 1 60