Use the Binary Search Tree (BST) insertion algorithm to insert 0051 into the BST below. List the nodes of the resulting tree in pre-order traversal order separated by one blank character. For example, the tree below can be described in the above format as: 65 33 25 47 52 50 88 74 80 77 0065 0033 0088 0025 0047 0074 0052 0080 0050 0077

For the following questions, perform the operations in sequence. So, for example, part (b) should use part (a) as input. Follow the conventions regarding deletion and duplicate insertion used in class. Make a binary search tree by inserting the numbers 25, 14, 3, 2, 23, 75, 62, 52, 82, 79, 15, 100, 1, 18, 24, 8, 65, 5, 12, and 80 one at a time. You only need to show the final result, not each step. (a) Insert 55 into the tree. DInsert 14 into the tree.

Use the Binary Search Tree (BST) insertion algorithm to insert 0078 into the BST below. List the nodes of the resulting tree in pre-order traversal order separated byłone blank character. For example, the tree below can be described in the above format as: 75 53 24 57 84 77 76 82 92 0075 0053 0084 0024 0057 0077 0092 0076 0082

Please show steps clearly

Consider the binary search tree in the picture below. Delete key 80 and show the tree after deletion.

Question 3: Delete the element “66” in the following Binary Search Tree and show the resultingBST. Write the steps in deletion process.

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