《数据结构与算法分析》(C++第二版)【美】 CliffordA.Shaffer著课后习题答案二 5 BinaryTrees 5.1Consideranon-fullbinarytree.Bydefinition,thistreemusthavesomeinternal nodeXwithonlyonenon-emptychild.Ifwemodifythetreetoremove X,replacingitwithitschild,themodifiedtreewillhaveahigherfractionof non-emptynodessince...
内容提示: 《数据结构与算法分析》(C++ 第二版)【美】Clifford A.Shaffer 著 课后习题答案 二 5 Binary Trees 5.1 Consider a non-full binary tree. By definition, this tree must have some internal node X with only one non-empty child. If we modify the tree to remove X, replacing it with ...