I have to make this tree for an assignment which is m-ary,let m be 10. Assuming each node has just one info field, the value of each parent node should also be stored in its leftmost child.The children of each node are in ascending order from left to right. Also all the leaf nodes should form a doubly linked list... Can someone please tell me how to do insertion,deletion and search operations for such a tree or can atleast tell me its name so that i can search for the same.
