Please do referable transcribe a genuine program.
The tally should be an explaination of your algorithm or pseudocode. Try to tally lucidly and concisely. Thank you very fur.
Transcribe an algorithm that checks if a absorbed tree is a lawful AVL tree. An
AVL tree is a binary quest tree, so that restraint integral vertex v if hleft is the crisis of the
tree of the left slip of v and hright is the crisis of the tree of the suitable 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)