Algorithm Question:
Please do not write a real program.
The answer should be an explaination of your algorithm or pseudocode. Try to answer clearly and concisely. Thank you very much.
Question:
Write an algorithm that checks if a given tree is a legal AVL tree. An
AVL tree is a binary search tree, so that for every vertex v if h

_{left}is the height of the tree of the left child of v and h_{right}is the height of the tree of the right child of v, then |h_{left}− h_{right}| ≤ 1