Explain B Tree and B+ Tree

432views

written 6.5 years ago by

kaivanshah • 280

modified 6.5 years ago by

sanketshingote • 100

B Tree

In a binary search tree, AVL Tree, Red-Black tree etc., every node can have only one value (key) and maximum of two children but there is another type of search tree called B-Tree in which a node can store more than one value (key) and it can have …

Create a free account to keep reading this post.

and 4 others joined a min ago.

ADD COMMENT EDIT