codeables | free code's

Implementation of a B-Tree



OUTPUT:

maximum number of keys in a node ? :4


1)Insert
2)Search
3)Delete
4)Print
5)Quit
Enter your choice : 1

Enter a data : 10

Tree after insertion :
(10 )

1)Insert
2)Search
3)Delete
4)Print
5)Quit
Enter your choice :  1

Enter a data : 20

Tree after insertion :
(10 20 )

1)Insert
2)Search
3)Delete
4)Print
5)Quit
Enter your choice : 1

Enter a data : 30

Tree after insertion :
(10 20 30 )

1)Insert
2)Search
3)Delete
4)Print
5)Quit
Enter your choice : 1

Enter a data : 40
Tree after insertion :
(10 20 30 40 )

1)Insert
2)Search
3)Delete
4)Print
5)Quit
Enter your choice : 1

Enter a data : 50

Tree after insertion :
(30 )
(10 20 )  (40 50 )

1)Insert
2)Search
3)Delete
4)Print
5)Quit
Enter your choice : 1

Enter a data : 60

Tree after insertion :
(30 )
(10 20 )  (40 50 60 )

1)Insert
2)Search
3)Delete
4)Print
5)Quit
Enter your choice : 1

Enter a data : 70

Tree after insertion :
(30 )
(10 20 )  (40 50 60 70 )

1)Insert
2)Search
3)Delete
4)Print
5)Quit
Enter your choice : 1

Enter a data : 80
Tree after insertion :
(30 60 )
(10 20 )  (40 50 )  (70 80 )

1)Insert
2)Search
3)Delete
4)Print
5)Quit
Enter your choice : 2

Enter a data : 10

Found in the node : (10 20 )

1)Insert
2)Search
3)Delete
4)Print
5)Quit
Enter your choice : 2

Enter a data : 15

Not found

1)Insert
2)Search
3)Delete
4)Print
5)Quit
Enter your choice :3
Enter a data : 10

(60 )
(20 30 40 50 )  (70 80 )

1)Insert
2)Search
3)Delete
4)Print
5)Quit
Enter your choice : 3

Enter a data : 70

(50 )
(20 30 40 )  (60 80 )

1)Insert
2)Search
3)Delete
4)Print
5)Quit
Enter your choice : 3

Enter a data : 30

(50 )
(20 40 )  (60 80 )

1)Insert
2)Search
3)Delete
4)Print
5)Quit
Enter your choice : 3

Enter a data : 60

(20 40 50 80 )

1)Insert
2)Search
3)Delete
4)Print
5)Quit
Enter your choice : 5

Download :