A node in a binary tree is a called a single child, if it has nosiblings (Its parent has only one child). Consider a single noderatio on a tree T.
SC(T) = (The number of single child nodes in T ) / (The numberof nodes in T )
. 1. Compute the ratio SC on a binary search tree that has acost O(n) for searching.
2. Prove that for an AVL tree T, the ratio SC(T) ≤ 1/2 .
3. Is it true that if a binary tree T has SC(T) ≤ 1/2 , then itsheight is O(lg n
Expert Answer
An answer
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured