Interested to Buy Any Domain ? << Click Here >> for more details...
In RDBMS, what is the efficient data structure used in the internal storage representation?
- 1 Answers
- 1540 Views
- I also Faced
- E-Mail Answers
Answer / rohit sah
B+ tree. Because in B+ tree, all the data is stored only in leaf nodes, that makes searching easier. This corresponds to the records that shall be stored in leaf nodes.
| Is This Answer Correct ? | 1 Yes | 0 No |
Differentiate between arraylist and linkedlist.
What do you mean by back edge?
How many null values are allowed in hashmap?
How would you swap the Kth node from beginning with Kth node from end in a Linked List.
How to find 3rd element from end in a linked list in one pass?
Is hashmap fail safe?
A lot of data structures related programs related to only trees and graphs, like the diameter of a tree, removing the loops in a graph etc.
What is heap tree explain with example?
What are three common types of traversals?
How to use appendNode() in linkedlist()?
Define a priority queue?
What is the purpose of sorting algorithms?
Windows 
