what is another way to test whether a binary tree is balanced other than recursively calling the size function on the left and right subtrees. abs(size left - size right) <= 1 for the tree to be balanced. I must write an efficient function to satisfy the requirement but like i said does not recursively call the size function on the left and right subtrees.