Description

Program of insertion and deletion in B tree...In data structures, a B-tree is a tree data structure that keeps data sorted and allows searches, insertions, and deletions in logarithmic amortized time. Unlike self-balancing binary search trees, it is optimized for systems that read and write large blocks of data. It is most commonly used in databases and filesystems.

Source Code

/*Program of insertion and deletion in B tree*/

#include<stdlib.h>

#include<stdio.h>

#define M 5



struct node{

	int n; /* n < M No. of keys in node will always less than order of B tree */

	int keys

... (login or register to view full code)

To view full code, you must Login or Register, its FREE.

Hey, registering yourself just takes less than a minute and opens up a whole new GetGyan experience.