Q3/ Suppose that we first insert an element x into a binary search tree that does not)already contain x. Supposethat we then immediately delete x from the tree. Will the new tree be identical to the original one? If yes give thereason 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 bythe 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 (A; B; 9) says there is an edge from A to B with weight 9.Make a drawing of the graph with sufficient space among the vertices. And run Dijkstra's algorithrm on this graphwith start vertex A

Note: As per the bartleby guideline i can answer 1 question at a time. If you want the answer the…

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.

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.

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

Write a method isBST() that takes a Node as argument and returns true if the argument node is the root of a binary search tree, false otherwise.Hint : This task is also more difficult than it might seem, because the order in which youcall the methods in the previous three exercises is important
In Java, Insert the following numbers from left to right into an initial empty BST and print the final tree level by level. 50, 20, 30, 40, 80, 70, 60, 20, 100, 90, 50, 10 a. Assume probability to search for the data in the tree is the same, compute average no. of comparison for above bst.
In the binary search tree, write a function that takes in a root, p, and checks whether the tree rooted in p is a binary search tree or not. What is the time complexity of your function? def is_bst(self, p: Node):
Homework: AI Search Techniques Here are a set of slides that illustrate alpha-beta pruning. 1. Annotate the following search tree with the minimax value of each node. MAX MIN MAX 3 6 2 2 1 9 5 3 1 5 4 7 5
A binary search tree class that has the methods insert, find, and delete as well as the method getRandomNode(), which extracts a random node from the tree, is something you build from scratch. Each node should have an equal chance of being chosen. Make a getRandomNode algorithm, use it, and then explain how you would make the other methods.
Tree: For the following Binary Search (37,24,35,53,55,65,69) of root 37, if you add the item 63 to the tree, the postorder traversal will be: 35, 24, 63, 69, 65, 55, 53, 37 O24, 35, 37, 55, 53, 63, 65, 69 Skip O 35, 24, 65, 69, 63, 55, 53, 37 O24, 37, 35, 53, 55, 63, 65, 69
Construct a binary search tree (BST) with the following list 29, 37, 12, 20, 19, 45, 36, 40, 61, 60, 6,1. Read the list from left to right. a. Delete nodes 12 and 45 and reconstruct the tree. b. Delete nodes 20 and 37 and reconstruct the tree.
How many comparisons are needed to find that 22 is not in the tree? 12 28 2 4 3 1
Tree: For the following Binary Search (37,24,35,53,55,65,69) of root 37, if you add the item 63 to the tree, the postorder traversal will be: 35, 24, 63, 69, 65, 55, 53, 37 O24, 35, 37, 55, 53, 63, 65, 69 Skip O 35, 24, 65, 69, 63, 55, 53, 37 O24, 37, 35, 53, 55, 63, 65, 69
Write a code to implement binary search tree. Implement all the methods, find, insert, delete, minimum, max, find successor. Test out all the methods.
Construct a binary search tree from the list of the following keys using inserts: 18 2 9 6 7 4 3 20 16 17 8 12 5 4 The key 18 is the first one that will be inserted into the tree.Draw the final tree and 3 other trees to show the intermediate steps.Do an inorder traversal of the tree. What's the list you get?
Page 424 of the text has a 2-3 tree captioned “Anatomy of a 2-3 search tree”. Draw what the tree looks like if the key “T” is inserted into this tree.