searching for an element in - tree the search operation is used to determine whether data value is present in - tree the process of searching value in - tree is very similar to searching value in binary search tree the search for data value starts at the root if and are the two values stored in the root nodethen if move to the left child if > and the node has only two childrenmove to the right child if > and the node has three childrenthen move to the middle child if else to the right child if > at the end of the processthe node with data value is reached if and only if is at this leaf example consider the - tree in fig and search in the tree step as move to the middle child step as move to the left child figure searching for element in the - tree of fig lmr lmr figure (ainserting new element in - tree to insert new value in the - treean appropriate position of the value is located in one of the leaf nodes if after insertion of the new valuethe properties of the - tree do not get violated then insertion is over otherwiseif any property is violated then the violating node must be split (fig splitting node node is split when it has three data values and four children herep is the parent and lmr denote the leftmiddleand right children