Please enable JavaScript.
Coggle requires JavaScript to display documents.
Trees, Searching and Insertion in a Binary Search Tree, Binary Tree…
Trees
Its principal application, called the B+-tree
-
-
The B-tree is a balanced search tree that generalizes the idea of the 2-3 tree by allowing multiple keys at the same node.
By choosing the order of the tree appropriately, one can implement the operations of searching, insertion, and deletion with just a few disk accesses even for extremely large files.
-
-