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.

How many comparisons are needed to find that 22 is not in the tree? 12 28 2 4 3 1

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?

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

Consider the following binary search tree: 5 10 17 20 30 If the value 9 were inserted into this tree, where in the tree would it be inserted? ○ It would be the left child of the node containing 17 It would be the right child of the node containing 17 It would be the right child of the node containing 5 It would be the new left child of the node containing 10