Question: Write a recursive algorithm in pseudo code that returns the height of a binary tree in linear time iff all nodes meet the balance-property of
Write a recursive algorithm in pseudo code that returns the height of a binary tree in linear time iff all nodes meet the balance-property of AVL-trees, and -1 otherwise. You are not allowed to store the height in the nodes.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
