Request New Subject
Home
Data Structures (DS)
Non Linear Data Structures - Trees
Q. The minimum height of self balancing binary search tree with n nodes is (Solved)
1. log2(n)
2. n
3. 2n + 1
4. 2n – 1
a. log2(n)
Related Topics
→ Linear Data Structures -Stacks and Queues
→ Non Linear Data Structures - Graphs
→ Searching, Sorting and Hashing Techniques
Subscribe Now
Get All Updates & News
Subscribe