2. Consider the binary search tree below. 50 a) Show the given tree after inserting a new node with the value 65 in the tree. b) Show the given tree after you delete the node 40 from the tree. c) Show the tree in b) after you delete the root node.

2. Consider the binary search tree below. 50 a) Show the given tree after inserting a new node with the value 65 in the tree. b) Show the given tree after you delete the node 40 from the tree. c) Show the tree in b) after you delete the root node.

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

48. Fullness Experiment: a. Design and implement a method height for BinarySearchTree that returns the height of the tree (you have already done this if you completed Exercise 32). b. Define the fullness ratio of a binary tree to be the ratio between its minimum height and its height (given the number of nodes in the tree). For example, the tree in Figure 7.5a has a fullness ratio of 1.00 (its minimum height is 3 and its height is 3) and the tree in Figure 7.6c has a fullness ratio of 0.33 (its minimum height is 3 and its height is 9). Implement a method fRatio to be added to the BinarySearchTree class that returns the fullness ratio of the tree. C. Create an application that generates 10 "random" trees, each with 1,000 nodes (random integers between 1 and 3,000). For each tree output its height, optimal height, and fullness ratio. d. Submit a report that includes your code for the height method, the fRatio method, the application code, sample output, and a short discussion. The…
Binary Search Tree. Perform the following operations and instructions. a. Insert the following in BST: 52, 40, 62, 24, 58, 69, 32, 59 b. Identify the following: 1. leaf nodes II. root node iii. height of the tree c. Draw the BST after Deleting node 59 d. Give the following: I. In-order Traversal ii. Pre-order Traversal iii. Post-order Traversal Insert the following in BST: 52, 40, 62, 24, 58, 69, 32, 59
5. Draw the final binary search tree that results after inserting the following keys in the order they appear here: 24 18 67 68 69 25 19 20 11 93
Insert the following numbers into a binary search tree in the order that they are given and draw the resulting tree. 87; 36; 22; 15; 56; 85; 48; 90; 72; 6 Delete 48 and draw the resulting tree. Delete 15 and draw the resulting tree.
In the Union/Find algorithm, the ranks of the nodes on a path will increase monotonically from?a) leaf to rootb) root to nodec) root to leafd) left subtree to right subtree
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.
Which of the following statements are correct for a binary search tree?( more than one can be correct ) a) The root always contains the largest key. b) All keys in the left subtree are always smaller than any key in the corresponding right subtree. c) All leaves are located on the same level. d) Each subtree is also a binary search tree.
c. Write steps to delete a node with information 35 from the given binary search tree,then redraw the tree after deleting node. 50 60 40 25 35 37 38 45 47 55 75 78
Algorithm
B) What are the differences between array and linked list. C) What is meant by Binary Search Tree, (1) construct a binary tree by inserts the given values: (35, 33, 50, 10, 60, 22, 17, 48, 92,55,7). (2) Insert 58, 25 respectively (3) Delete 92, 35.
Using c++
1. Create a Java program that prompts the user the initial choices for the Binary Search Treea. User chooses 1: Insert, User chooses 2: Delete, User chooses 3: Show BinaryTree, User chooses 4: Exit Program 2. Insertion in a tree should be such that it obeys the main properties of the binary searchtree. The basic algorithm should be:a. If the node to be inserted is greater than the existing root, move down a levelthrough the right pointer of the root.b. If the node to be inserted is lesser than the existing root, move down a levelthrough the left pointer of the root.c. Repeat this process for all nodes till the leaves are reached.d. Insert the node as the left or right pointer for the leaf (based on its value - if it issmaller than the leaf, it should be inserted as the left pointer; if it is larger than theleaf, it should be inserted as the right pointer) 3. Deletion is a bit more complicated than insertion because it varies depending on the nodethat needs to be deleted from the…