Question

Question 21 A binary tree (including subtrees) in which one of its subtrees has a significantly larger height than the other subtree is considered unbalanced. Question 22 Consider the following property: "For every internal position p of a tree T, the heights of the children of p differ by at most 1." This is known as the height-balance property. It is used to characterize a binary search tree in terms of its nodes. Any binary search tree that satisfies the height-balance property is said to be an AVL tree. Question 23 The process of re-establishing heap property is called re-heaping.

          Question 21  
A binary tree (including subtrees) in which one of its subtrees has a significantly larger height than the other subtree is considered unbalanced. 

Question 22   
Consider the following property: 
"For every internal position p of a tree T, the heights of the children of p differ by at most 1." 
This is known as the height-balance property. It is used to characterize a binary search tree in terms of its nodes. 
Any binary search tree that satisfies the height-balance property is said to be an AVL tree. 

Question 23  
The process of re-establishing heap property is called re-heaping.

Added by Noelia W.

Question

Please give Ace some feedback