Data Structure

1. B-Tree

2. Properties
All leaf nodes must be at same level.
All nodes except root must have at least [m/2]-
1 keys and maximum of m-1 keys.
All non leaf nodes except root (i.e. all internal
nodes) must have at least m/2 children.
If the root node is a non leaf node, then it must
have atleast 2 children.
All the key values in a node must be
in Ascending Order.

3. Types
 Order 3
 2-3 tree
 Order 4
 2-3-4 tree

12. Practice
• 5,3,21,9,1,13,2,7,10,12,4,8 order 4

14. Deletion

15. Deletion

16. Deletion

17. Deletion

18. Deletion

19. Deletion

20. Deletion

21. Deletion

22. Deletion

23. Deletion

24. Deletion

25. Consider the B tree of order 3 given below and perform the following
operations: (a) insert 121, 87 and then (b) delete 36, 109.

26. Consider the B tree of order 3 given below and perform the following
operations: (a) insert 121, 87 and then (b) delete 36, 109.

27. Consider the B tree of order 3 given below and perform the following
operations: (a) insert 121, 87 and then (b) delete 36, 109.

28. Consider the B tree of order 3 given below and perform the following
operations: (a) insert 121, 87 and then (b) delete 36, 109.

29. Consider the B tree of order 3 given below and perform the following
operations: (a) insert 121, 87 and then (b) delete 36, 109.