What is the following code segment of AVL tree do? int avl(binarysearchtree root): if(not root) return 0 left_tree_height = avl(left_of_root) if(left_tree_height_.w
−1) return left_tree_height right_tree_height=avl(right_of_root) if(right_tree_height_.-1) return right_tree_height Perform tree traversal Not any of these Algorithm for height balance Check the validity of AVL. tree