notes leaf[ <true [ < disk-write(xroot[ < the -tree-create operation creates an empty -tree by allocating new root node that has no keys and is leaf node only the root node is permitted to have these propertiesall other nodes must meet the criteria outlined previously the -tree-create operation runs in time ( -tree-split-child(xiyz <allocate-node(leaf[ <leaf[yn[ < for < to do keyj[ <keyj+ [yif not leaf[ythen for < to do cj[ <cj+ [yn[ < for < [ downto do cj+ [ <cj[xci+ < for < [xdownto do keyj+ [ <keyj[xkeyi[ <keyt[yn[ < [ disk-write(ydisk-write(zdisk-write(xif is node becomes "too full,it is necessary to perform split operation the split operation moves the median key of node into its parent where is the ith child of new nodezis allocatedand all keys in right of the median key are moved to the keys left of the median key remain in the original node the new nodezbecomes the child immediately to the right of the median key that was moved to the parent yand the original nodexbecomes the child immediately to the left of the median key that was moved into the parent the split operation transforms full node with keys into two nodes with keys each note one key is moved into the parent node the -tree-split-child algorithm will run in time (twhere is constant -tree-insert(tkr <root[tif [ lovely professional university