How does a treemap sort?



How does a treemap sort?..

Answer / Mujeeb Akhtar

A TreeMap sorts its keys in ascending order by default. The tree maintains an ordered set of key-value pairs, where the left child's key is always less than the parent's key, and the right child's key is greater than the parent's key.

Is This Answer Correct ?    0 Yes 0 No

Post New Answer

More Data Structures Interview Questions

What are different dynamic memory allocation technique in c.

1 Answers  


What is push and pop in stack?

1 Answers  


In an AVL tree, at what condition the balancing is to be done?

1 Answers  


What do you mean by Base case, Recursive case, Binding Time, Run-Time Stack and Tail Recursion?

2 Answers   TCS,


Write an algorithm to show the reverse of link list?

1 Answers  


Define hashing?

1 Answers  


Define non linear data structure.

1 Answers  


How many types of arrays are there in visual basic?

1 Answers  


Describe the height term in a tree.

1 Answers  


What is the time complexity of selection sort?

1 Answers  


What is the average number of comparisons needed in a sequential search to determine the position of an element in an array of 100 elements, if the elements are ordered from largest to smallest?

19 Answers   ABB, SDE,


Differentiate linear from non linear data structure?

1 Answers  


Categories