A binary tree is said to have heap property if the elements along any path:
A. from leaf to root are non-increasing
B. from leaf to root are non-decreasing
C. from root to leaf are non-decreasing
D. from root to leaf are non-increasing
Answer:D
A binary tree is said to have heap property if the elements along any path:
A. from leaf to root are non-increasing B. from leaf to root are non-decreasing C. from root to leaf are non-decreasing D. from root to leaf are non-increasing