Interested to Buy Any Domain ? << Click Here >> for more details...
When will you sort an array of pointers to list elements,
rather than sorting the elements themselves?
- 5 Answers
- 22926 Views
- I also Faced
- E-Mail Answers
Answer Posted / basav (shiv shankar)
It can be used when we store data elements at the bottom.
i.e., while storing data/records at the leaf level. Here we
generally store pointers in nodes in sorted order to make
sure the linear order of records.
Example, B+ trees.
| Is This Answer Correct ? | 2 Yes | 0 No |
Post New Answer View All Answers
What is red black tree in data structure?
What is the difference between push and pop?
What is the complexity of selection sort?
Is an arraylist an object?
Explain implementation of deletion from a binary tree.
Is binary tree a bst?
What is difference between hashmap and treemap?
What is time complexity of binary search?
What is a comparator function?
Define 2-3-4 tree?
How can I study data structures and algorithms?
Define hash function?
What type of variable is age?
What is the complexity of arraylist?
Are linked lists considered linear or non-linear data structures?
