数据结构课件汇习题课十章参.pdfVIP

P.441

E2

(a)(1)1,2,3,4,5(2)2,4,5,3,1(3)5,4,3,2,1

(b)(1)1,2,3,4,5(2)1,3,5,4,2(3)5,4,3,2,1

(c)(1)1,2,3,5,7,8,6,4(2)1,7,5,8,3,6,2,4(3)7,8,5,6,3,4,2,1

(d)(1)1,2,4,7,3,5,6,8,9(2)4,7,2,1,5,3,8,6,9(3)7,4,2,5,8,9,6,3,1

P441E5

templateclassEntry

intBinary_treeEntry::recursive_leaf_count

(Binary_nodeEntry*sub_root)const

/*Post:Thenumberofleavesinthesubtreerootedatsub_rootisreturned.*/

{

if(sub_rootNULL)return0;

if(sub_root-leftNULLsub_root-rightNULL)return1;

returnrecursive_leaf_count(sub_root-left)+

recursive_leaf_count(sub_root-right);

}

templateclassEntry

intBinary_treeEntry::leaf_count()const

/*Post:Thenumberofleavesinthetreeisreturned.*/

{

returnrecursive_leaf_count(root);

}

P443E11

templateclassEntry

voidBinary_treeEntry::recursive_double_traverse

(Binary_nodeEntry*sub_root,void(*visit)(Entry))

if(sub_root!=NULL){

(*visit)(sub_root-data);

recursive_double_traverse(sub_root-left,visit);

(*visit)(sub_root-data);

recursive_double_traverse(sub_root-right,visit);

}

}

templateclassEntry

voidBinary_treeEntry::double_traverse(void(*visit)(Entry))

{

recursive_double_traverse(root,visit);

}

P．459

E2

m

(e)(f)重复关键字

E3

注意：答案不唯一。采上所给方法删除的结果可能与在此列出的不一样。