**Contents**show

## What is B+ tree with example?

A B+ tree is an **m-ary tree with a variable but often large number of children per node**. A B+ tree consists of a root, internal nodes and leaves. The root may be either a leaf or a node with two or more children.

…

B+ tree | |
---|---|

Type | Tree (data structure) |

Time complexity in big O notation |

## Is B-tree and binary tree same?

Unlike binary tree, in B-tree, a node can have more than two children. B-tree has a height of logM N (Where ‘M’ is the order of tree and N is the number of nodes).

…

Binary Tree :

S.NO | B-tree | Binary tree |
---|---|---|

5. | B-tree is used in DBMS(code indexing, etc). | While binary tree is used in Huffman coding and Code optimization and many others. |

## Why are B-tree indexes so popular?

The B-tree **enables the database to find a leaf node quickly**. The tree traversal is a very efficient operation—so efficient that I refer to it as the first power of indexing. It works almost instantly—even on a huge data set. … That means that the tree depth grows very slowly compared to the number of leaf nodes.