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