数据结构与算法分析（C+第二版）【美】Clifford A.Shaffer著 课后习题答案 二5Binary Trees5.1 Consider a non-full binary tree. By definition, this tree must have some internalnode X with only one non-empty child. If we modify the tree to removeX, replacing it with its child, the modified tree will have a higher fraction ofnon-empty nodes since one non-empty node and one empty node have beenremoved.5.2 Use as the base case the tree of one leaf node. The number of degree-2 nodesis 0, and the number of leaves is
