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
Is treemap thread safe?
What are the four characteristics of algorithms?
Which interface treemap implements?
State the rules to be followed during infix to postfix conversions?
Are duplicates allowed in list?
What are the two traversal strategies used in traversing a graph?
Define Data Structures?
What is difference between hashmap and linkedhashmap?
What do you mean by rehashing?
Does linked list allow duplicates?
How will you represent a linked list in a graphical view?
List the differences between comparable and comparator interface?
State the different ways of representing expressions?
Does hashset allow duplicates?
How do you get placements?
