b-tree

B Tree vs B+ Tree

B-Tree is known as a self-balancing tree as its nodes are sorted in the inorder traversal. 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). B+ tree eliminates the drawback B-tree used for indexing by storing data pointers only at the leaf nodes of the tree. Thus, the structure of leaf nodes of a B+ tree is quite different from the structure of internal nodes of the B tree.

Posted September 12, 2022 by Rohith and Anusha ‐ 2 min read

quick-references blog differences b-tree b+-tree

Binary Tree vs B Tree

A binary tree is the special type of general tree. Unlike B-tree, in a binary tree a node can have at most two nodes. In a binary tree, there is a limitation on the degree of a node because the nodes in a binary tree can’t have more than two child node(or degree two). B-Tree is known as a self-balancing tree as its nodes are sorted in the inorder traversal. Unlike the binary trees, in B-tree, a node can have more than two children.

Posted September 12, 2022 by Rohith and Anusha ‐ 1 min read

quick-references blog binary-tree b-tree differences

Subscribe For More Content