Q.No.4. C 3 16 4 Q 17 Consider the following alphabet with equivalent code number. R 18 19 a) Design a binary search tree of your Full Name( let take this as a Name (WASIF-GUL)) by taking its equivalent digit and provide a post order traversal of it. The code for blank space is 0. 7 20 H. 21 V 22 J 10 W 23 K 11 24 L. 12 Y 25 b) Write algorithms for the following functions (in 13 26 binary search tree) I. that counts the number of nodes in a binary search tree that sums up all the keys in a binary search tree II.

Q.No.4. C 3 16 4 Q 17 Consider the following alphabet with equivalent code number. R 18 19 a) Design a binary search tree of your Full Name( let take this as a Name (WASIF-GUL)) by taking its equivalent digit and provide a post order traversal of it. The code for blank space is 0. 7 20 H. 21 V 22 J 10 W 23 K 11 24 L. 12 Y 25 b) Write algorithms for the following functions (in 13 26 binary search tree) I. that counts the number of nodes in a binary search tree that sums up all the keys in a binary search tree II.

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 preorder traversal of the tree? (Ensure that there is A SPACE between each number)
Which of the following is not true about binary search trees?a)A binary search tree can not be empty.b)For a node "n" in a a binary search tree, n's value greater than all values in its left subtree.c)A binary search tree is a binary tree that is sorted according to the values in its nodes.d)All nodes within a binary search tree are binary search trees.
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)
Place the following sequence of elements in an empty binary search tree (BST): 26, 44, 63, 83,17, 19, 8, 41, 37, 21, 14, 5, 13, 16. Below are a number of questions about the resulting binary search tree. Indicate which statement (s) are correct. A. The leaves of the tree contain elements 5, 13, 16, 21, 37 and 83. B. The leaves of the tree contain elements 5, 13, 16, 19, 37 and 83. C. The tree has a height of 3. D. A BST containing 14 elements has a height of at least 3 and at most 13. Group of answer options Only statements B and D are correct. Only statements B, C and D are correct. Only statement D is correct. Only statements A, C and D are correct. Only statements A and D are correct.
Q5_2\ Draw the binary search tree that would result from the insertion of the following integer keys: 14 58 18 10 99 52 33 69 47 17.
Draw a binary search tree and AVL tree from the following traversals: {15, 5, 20, 70, 3, 10, 60, 90, 16} Convert Binary Search Tree into Binary Tree such that sum of all greater keys is added to every key. Write a code to Convert Binary Search Tree drawn into Balanced Binary Search TreeNOTE: Code is required in Java
Suppose you have a binary search tree in which the elements are integers and were stored in this order: 24, 80, 13, 48, 18, 23, 32, 40, 19, 1, 57, 7. Answer the following questions about this binary search tree (BST): a) What is the root of the BST? b) Which nodes will be the leaves of this BST (list the integers)? c) What is the height of this BST? d) Is this BST balanced? e) Suppose you wanted to remove the node that contains the number 24. Name one of the possible candidate nodes that one could use to replace that node on the tree in the position of 24.
Q2. a. What is a Binary Search Tree? b. Draw the Binary Search Tree that results from the insertion, one at a time, of nodes with Keys 27, 59, 21, 38, 54, 63, 8, 70, 15, 12. (Marking Scheme: Each correct insertion in the tree will give you c. Perform the following operations on the original tree and redraw the tree after each operation ) i.deleting 63 ii.deleting 59 iii.Insert 65 iv.Insert 22 d. Write down the inorder, preorder and postorder traversal on the constructed binary tree.
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?
1. Construct a binary tree for the numbers 3,4,5,6,7,8,9. Then for each number input taken at runtime, show the number of iterations required to reach that node from root node containing the target number. (10) 2. Construct a binary tree with the following keys as strings a. Desktop, CSU, Spring2022, CIS260, CIS 265, Vacation, Hackathon Your first task is to put this data in an array of string and search for a folder name. Let us say that the folder name is “Hackathon”. Using the array subscript, how many iterations does it take to find the folder? (10) Next, convert this array into a Binary tree and arrange in alphabetical order, and try to find the same folder. List the number of Iterations.(10) Bonus: Now replace the folder names with file contents. So you need a File class where there is a filename variable and file content variable, both should be strings. So the node would have file object instead of just names. So you have an array of File class objects, so the binary tree will…
Draw a binary search tree by inserting the following numbers and determine the predecessor and successor of 10, 1, and 6. numbers to insert {8,1,5,4,9,10,6,3,15}