Answer Posted / princy
it is a height balanced binary search tree!
| Is This Answer Correct ? | 5 Yes | 1 No |
Post New Answer View All Answers
Tell us the difference between merge and quick sort. Which one would you prefer and why?
List the types of rotations available in splay tree?
Does hashset allow duplicates?
Describe avl tree or height balanced binary search tree.
What are the different types of data structures?
Is hashset a collection?
Is vector synchronized?
How do you determine if a binary tree is height balanced?
Explain the common uses of threaded binary tree.
State the difference between stacks and linked lists?
When would you use a hashmap?
Which is the parent class of deque
Which sorting is best?
Which sorting technique is best in worst case?
How to excel in data structures and algorithms?