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.
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
heightdiff = getHeight(root.left) – getHeight(root.right)
if abs(heightdiff) > 1
return IsAVL(root.left) && IsAVL(root.right)