Skip to content

Tag Archives: B-Tree

A B-Tree is a self-balancing tree data structure widely used in database and file systems for its efficiency in storing and retrieving massive quantities of… Read More
B-Tree : 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… Read More
B-Tree Insert without aggressive splittingThis algorithm for insertion takes an entry, finds the leaf node where it belongs, and inserts it there. We recursively insert… Read More
R-tree is a tree data structure used for storing spatial data indexes in an efficient manner. R-trees are highly useful for spatial data queries and… Read More
B + tree is a variation of B-tree data structure. In a B + tree, data pointers are stored only at the leaf nodes of… Read More
In this article, we will discuss different types of problems based on B and B+ trees. Before understanding this article, you should understand basics of… Read More
It is recommended to refer following posts as prerequisite of this post.B-Tree | Set 1 (Introduction) B-Tree | Set 2 (Insert)B-Tree is a type of a… Read More
  In the previous post, we introduced B-Tree. We also discussed search() and traverse() functions. In this post, insert() operation is discussed. A new key is… Read More