How to determine if a binary tree is height-balanced? A tree where no leaf is much farther away from the root than any other leaf. Different balancing schemes allow different definitions of “much farther” and different amounts of work to keep them balanced. Consider a height-balancing scheme where following conditions should be checked to determine if a binary tree is balanced. An empty tree is height-balanced. A non-empty binary tree T is balanced if:
Read full article from How to determine if a binary tree is height-balanced? | GeeksforGeeks
No comments:
Post a Comment