notes ift =null return nullift->left =null return treturn findmint->left )/*internal method to find the largest item in subtree return node containing the largest item *avlnode findmaxavlnode * const ift !null whilet->right !null ->rightreturn /*internal method to test if an item is in subtree is item to search for is the node that roots the tree *bool containsconst comparable xavlnode *tint &comps const ift =null return falseelse ifx element return containsxt->left++comps)else ift->element return containsxt->right++comps)else return true/match /*****nonrecursive version************************bool containsconst comparable xavlnode * const whilet !null lovely professional university