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 |
What are different dynamic memory allocation technique in c.
What is push and pop in stack?
In an AVL tree, at what condition the balancing is to be done?
What do you mean by Base case, Recursive case, Binding Time, Run-Time Stack and Tail Recursion?
Write an algorithm to show the reverse of link list?
Define hashing?
Define non linear data structure.
How many types of arrays are there in visual basic?
Describe the height term in a tree.
What is the time complexity of selection sort?
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?