notes of courseyou immediately see that the parent node now contains only one keyg this is not acceptable if this problem node had sibling to its immediate left or right that had spare keythen we would again "borrowa key suppose for the moment that the right sibling (the node with xhad one more key in it somewhere to the right of we would then move down to the node with too few keys and move the up where the had been howeverthe old left subtree of would then have to become the right subtree of in other wordsthe node would be attached via the pointer field to the right of ' new location since in our example we have no way to borrow key from siblingwe must again combine with the siblingand move down the from the parent in this casethe tree shrinks in height by one -tree algorithms -tree is data structure that maintains an ordered set of data and allows efficient operations to finddeleteinsertand browse the data in this discussioneach piece of data stored in -tree will be called "key"because each key is unique and can occur in the -tree in only one location -tree consists of "noderecords containing the keysand pointers that link the nodes of the -tree together every -tree is of some "order "meaning nodes contain from to keysand nodes are thereby always at least half full of keys keys are kept in sorted order within each node corresponding list of pointers are effectively interspersed between keys to indicate where to search for key if it isn' in the current node node containing keys always also contains + pointers lovely professional university