notes avlnode *root/*internal method to insert into subtree is the item to insert is the node that roots the subtree set the new root of the subtree *void insertconst comparable xavlnode ift =null new avlnodexnullnull )else ifx element insertxt->left )ifheightt->left heightt->right = ifx left->element rotatewithleftchildt )else doublewithleftchildt )else ift->element insertxt->right )ifheightt->right heightt->left = ift->right->element rotatewithrightchildt )else doublewithrightchildt )else /duplicatedo nothing ->height maxheightt->left )heightt->right /*internal method to find the smallest item in subtree return node containing the smallest item *avlnode findminavlnode * const lovely professional university