1. Consider the following binary search tree (BST): 43 30 2. 21 37 2000 73 33 al Draw the result tree after you have ins

[answerhappygod]

1 Consider The Following Binary Search Tree Bst 43 30 2 21 37 2000 73 33 Al Draw The Result Tree After You Have Ins 1 (36.04 KiB) Viewed 45 times

1. Consider the following binary search tree (BST): 43 30 2. 21 37 2000 73 33 al Draw the result tree after you have inserted the nodes 22 and 44 in that order. You only need to show the final result. (2 marks) b) Given the original tree, draw the result tree after you have deleted the nodes 33, 43 and then node 67. (Note: there may be more than one correct answer, but please choose only one). (3 marks) Consider the following characters in the string METHODS Draw the corresponding binary search tree. (4 marks)