# 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 referable transcribe a legitimate program.

The response should be an explaination of your algorithm or pseudocode. Try to response obviously and concisely. Thank you very plenteous.

Question:

Transcribe an algorithm that checks if a fond tree is a constitutional AVL tree. An
AVL tree is a binary quest tree, so that for every vertex v if hleft is the elevation of the
tree of the left slip of v and hright is the elevation of the tree of the suitable slip of v, then
|hleft − hright| ≤ 1

## Expert Response

Algorithm IsAVL(root)

start

if parent==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