Request New Subject
Home
Data Structures (DS)
Non Linear Data Structures - Trees
Q. What is the average case time complexity for finding the height of the binary tree? (Solved)
1. h = O(loglogn)
2. h = O(nlogn)
3. h = O(n)
4. h = O(log n)
d. h = O(log 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