1. Advanced Data Structure using C++

LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110)
Given a B‐Tree structure with an order of 5, we begin inserting 11,21,14 and 78.
The first insert creates a node that becomes the root. The next three inserts
simply place the data in the node in ascending key sequence. (a) When we try to
insert 97, we discover that the node if full. We therefore create a new right
subtree and move the larger half of the data to it, leaving the rest of the data in
the original node (b).
After creating the new node, we insert the median value data (21) into the
parent of the original node. Because the original node was a root, we create a
new root and insert 21 into it.
Algorithms
Search
Searching is similar to searching a binary search tree. Starting at the root, the
tree is recursively traversed from top to bottom. At each level, the search
chooses the child pointer (subtree) whose separation values are on either side
of the search value.Binary search is typically (but not necessarily) used within
nodes to find the separation values and child tree of interest.
Insertion
In order to insert a key into a B‐tree, first a B‐Tree search is performed to find
the correct location for the key. Then the key is inserted. Note that a node
usually may have a space available for another key and pointer. However, the
node may be already full and cannot accommodate another key. In that case,
Prepared By :­
Er. Harvinder Singh
Assist Prof., CSE, H.C.T.M (Kaithal) Page ‐ 215 ‐