Insertion in a B tree starts from

Options
- Root node
- Any node
- Could be a or b
- leaf node

CORRECT ANSWER : leaf node

Discussion Board
Data Structure - B-tree

Insertion in a B tree starts from leaf node. A new key is always inserted at leaf node. A B-tree is a self-balancing tree data structure that keeps data sorted and allows search, sequential access, insertion, and deletion in logarithmic time.

Prajakta Pandit 02-1-2017 01:10 AM

ty

tyty

eer 10-10-2014 12:33 AM

Write your comments


Enter the code shown above:

(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)


Related Content

Advertisement
 
▲