B+ Tree

2) Internal node

3) External node or leaf node

A B+ tree can be viewed as a B-tree in which each node contain only keys and to an additional level is added at the bottom with linked leaves .

**What is B+ Tree ?****B+ Tree :**A B+ tree is an N-ary tree with a variable but often earge number of children per node .A B+ tree Consist Three Thing 1) Root2) Internal node

3) External node or leaf node

A B+ tree can be viewed as a B-tree in which each node contain only keys and to an additional level is added at the bottom with linked leaves .

**Time Complexity of**: Insertion , Deletion and searching all cases are take time in worst case is O( log n ) .**B+ Tree****Space Complexity****of**: Space Complexity in worst Case is O(n) .**B+ Tree****Properties****of**:**B+ Tree****b = Order of the B+ Tree**