Please do referable transcribe a existent program.
The solution should be an explaination of your algorithm or pseudocode. Try to solution obviously and concisely. Thank you very greatly.
Transcribe an algorithm that checks if a abandoned tree is a constitutional AVL tree. An
AVL tree is a binary exploration tree, so that for integral vertex v if hleft is the elevation of the
tree of the left branch of v and hright is the elevation of the tree of the correct branch of v, then
|hleft − hright| ≤ 1
heightdiff = getHeight(root.left) – getHeight(root.right)
if abs(heightdiff) > 1
return IsAVL(root.left) && IsAVL(root.right)