When will you sort an array of pointers to list elements,
rather than sorting the elements themselves?
- 5 Answers
- 21154 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
why boundary tag representation is used?
What is dynamic data structure?
What is weight balanced tree in data structure?
Can map contain duplicate keys?
What is subtree?
What are the different types of collections?
Differentiate between failfast and failsafe.
Can we store null in arraylist?
Which language is best for data structures?
Differentiate between collection and collections.
Define the queue data structure.
Is red black tree balanced?
What you mean by sorting?
What are the types of linked list?
What are the major data structures used in the following areas : network data model & hierarchical data model?
