CSE { computer science & engineering } Video Lectures.
In this Lecture you will be learning more about B-Tree.
A B-tree is a self-balancing tree data structure that maintains sorted data and allows searches, sequential access, insertions, and deletions in logarithmic time. The B-tree is a generalization of a binary search tree in that a node can have more than two children. Unlike other self-balancing binary search trees, the B-tree is well suited for storage systems that read and write relatively large blocks of data, such as discs. It is commonly used in databases and file systems.
For more info / doubt write us at our mail or comment below.
PLEASE LIKE , SHARE & SUBSCRIBE
