Definition of a Balanced Tree

Question

I am just wondering if someone might be able to clarify the definition of a balanced tree for me. I have that \"a tree is balanced if each sub-tree is balanced and the heigh

Answer 1

1. The height of a node in a tree is the length of the longest path from that node downward to a leaf, counting both the start and end vertices of the path.
2. A node in a tree is height-balanced if the heights of its subtrees differ by no more than 1.
3. A tree is height-balanced if all of its nodes are height-balanced.