Copy and paste is a design error. David Parnas

B Tree implementation

Language Java | Level Intermediate | Category Data structure | September 9, 2015 9:01 am


Data structure Description

B-tree is a tree data structure that keeps data sorted and support search, sequential access, insertions, and deletions in logarithmic time. If the data is not able to store in main memory, it store in the secondary memory.

B-tree is optimized for systems that read and write large blocks of data. So, the B-tree is a good data structure for external memory. It accesses the minimum number of times when to access the record from database.

Write a program to implement B-Tree?


Output

   					 

Sorting of randomly generated numbers using B TREE
The elements of the tree: 
99 37 20 10 3 19 19 21 35 35 95 86 55 47 77 75 59 67 83 89 
The sorted sequence is: 
3 10 19 19 20 21 35 35 37 47 55 59 67 75 77 83 86 89 95 99

				    

Comments


No comments available!

Please login to add comments.