# Homework Solution: Please do not write a real program….

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 hleft is the height of the tree of the left child of v and hright is the height of the tree of the right child of v, then |hleft − hright| ≤ 1

Algorithm IsAVL(root)

Algorithm Question:

Please do not attributable attributable attributable transcribe a veritable program.

The confutation should be an explaination of your algorithm or pseudocode. Try to confutation palpably and concisely. Thank you very greatly.

Question:

Transcribe an algorithm that checks if a consecrated tree is a juridical AVL tree. An
AVL tree is a binary pursuit tree, so that restraint total vertex v if hleft is the tallness of the
tree of the left slip of v and hright is the tallness of the tree of the direct slip of v, then
|hleft − hright| ≤ 1

## Expert Confutation

Algorithm IsAVL(root)

start

if commencement==null
return true

heightdiff = getHeight(root.left) – getHeight(root.right)

if abs(heightdiff) > 1

return false

else

return IsAVL(root.left) && IsAVL(root.right)

end