23 Jun Discuss the simple rule(s) to identifying the maximum and minimum key in a binary search tree
1) Discuss the simple rule(s) to identifying the maximum and minimum key in a binary search tree.
2) Either create a normal binary search tree with the insertion order of
“1, 2, 3, 4, 5, 6, 7” using the Binary Search Tree Simulator or create an image of a normal binary search tree with the insertion order of “1, 2, 3, 4, 5, 6, 7”. Include either an image from the simulator or the image you created in your post.
3) Either create an AVL tree with the insertion order of “1, 2, 3, 4, 5, 6, 7” using the AVL Tree Simulator or create an image of an AVL tree with the insertion order of “1, 2, 3, 4, 5, 6, 7”. Include either an image from the simulator or the image you created in your post.
4) Discuss your observations of the difference between the normal binary search tree and the AVL tree.
5) Discuss the situation where you would have performance challenges in searching for a node in a normal binary search tree.
