Question: Explain why we need to maintain a binary search tree in balance such as an AVL tree. Answer: Only a balanced tree can guarantee search

Explain why we need to maintain a binary search tree in balance such as an AVL tree. Answer: Only a balanced tree can guarantee search performance of O(logN). AVL tree's theoretical search performance is 1.44 log2N. (see lecture notes)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
