Construct a BST given the following tree walk sequence then answer the questions that follow (Q8-10). Inorder: 2, 3, 5, 8, 9, 11, 14, 17, 18 Postoder: 3, 2, 8, 5, 11, 17, 18, 14, 9 Note: root is the pointer to a BST Q8. How many nodes have degree of 2? Q9. What node will result from TREE-PREDECESSOR(parent of TREE-MINIMUM(root))? Q10. Perform TREE-SEARCH(root, H). How many node keys were compared with parameter value x (ie. k==key of x)?

Construct a BST given the following tree walk sequence then answer the questions that follow (Q8-10). Inorder: 2, 3, 5, 8, 9, 11, 14, 17, 18 Postoder: 3, 2, 8, 5, 11, 17, 18, 14, 9 Note: root is the pointer to a BST Q8. How many nodes have degree of 2? Q9. What node will result from TREE-PREDECESSOR(parent of TREE-MINIMUM(root))? Q10. Perform TREE-SEARCH(root, H). How many node keys were compared with parameter value x (ie. k==key of x)?

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

Draw a BST. Then write preorder, in-order and level order traversal. Also mention the height of the tree. insert 15, 20, 25, 18, 16, 5, 30, 47 and 7.
Question 3 Construct a Btree for the following set of key values: (12, 75, 10, 99, 25, 21, 9, 19, 22, 74, 82). Assume that the tree is initially empty and values are added in the presenting order. Draw the steps for builing the Btree for the case where the number of pointers, not values, that will fit in one node is five or 2d = 4. Full explain this question and text typing work only thanks
Draw a BST. Then write preorder, in-order and level order traversal. Also mention the height of the tree. Insert 15, 20, 25, 18, 16, 5, 30, 47 and 7. Insert 78, 45, 33, 89, 45, 20, 90, 100 and 8.
Please implement the followings: 1. Create the binary tree with 9 nodes by using pointer-based representation. struct TreeNode { int info; TreeNode * left; TreeNode * right; } 2. Implement pre-order, in-order, and post-order traversals, and print the results of the tree (Figure 1). 2 7 5 2 6 9 5 11 4 (Figure 1 and question in image below). Please help with number 2. Thank you.
From tree #1, how many nodes are visited by searching node(15)?
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 (a) (d) What is the height of the tree of part (a)? Draw the BST on the following data 40, 30, 50, 20, 35, 45, 60, 25, 33, 42, 65. Now draw its mirror image (e) BST Mirror of BST (f) Display the tree constructed in (e) using Breadth First Scarch 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 30 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.
Please implement the followings: 1. Create the binary tree with 9 nodes by using pointer-based representation. struct TreeNode { int info; TreeNode * left; TreeNode * right; } 2. Implement pre-order, in-order, and post-order traversals, and print the results of the tree (Figure 1). 2 7 5 2 6 9 5 11 4 (Figure 1 and question in image below). Please help.
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…
11. The following keys are added to an AVL tree: 50, 25, 80, 35, 20, 3, 2, 17, 18, 37, 36. Now remove 35, 36, 50, 37. Print the nodes with preorder traversal. If needed, draw the AVL tree also for partial credit.
Create a binary tree implementation using the recursive technique taught in the chapter. Each node in this method is a binary tree. As a result, a binary tree has a reference to the element stored at its root, as well as pointers to its left and right subtrees.You should also add a reference to its parent.
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.
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