Request New Subject
Home
Data Structures (DS)
Non Linear Data Structures - Trees
Q. What are the worst case and average case complexities of a binary search tree? (Solved)
1. O(n), O(n)
2. O(logn), O(logn)
3. O(logn), O(n)
4. O(n), O(logn)
d. O(n), O(logn)
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