6-11 先序输出叶结点 (15 分)
本题要求按照先序遍历的顺序输出给定二叉树的叶结点。
函数接口定义:
void PreorderPrintLeaves( BinTree BT );
其中BinTree
结构定义如下:
typedef struct TNode *Position;
typedef Position BinTree;
struct TNode{
ElementType Data;
BinTree Left;
BinTree Right;
};
函数PreorderPrintLeaves
应按照先序遍历的顺序输出给定二叉树BT
的叶结点,格式为一个空格跟着一个字符。
裁判测试程序样例:
#include <stdio.h>
#include <stdlib.h>
typedef char ElementType;
typedef struct TNode *Position;
typedef Position BinTree;
struct TNode{
ElementType Data;
BinTree Left;
BinTree Right;
};
BinTree CreatBinTree(); /* 实现细节忽略 */
void PreorderPrintLeaves( BinTree BT );
int main()
{
BinTree BT = CreatBinTree();
printf("Leaf nodes are:");
PreorderPrintLeaves(BT);
printf("\n");
return 0;
}
/* 你的代码将被嵌在这里 */
输出样例(对于图中给出的树):
Leaf nodes are: D E H I
1 #include <stdio.h> 2 #include <stdlib.h> 3 4 typedef char ElementType; 5 typedef struct TNode *Position; 6 typedef Position BinTree; 7 struct TNode{ 8 ElementType Data; 9 BinTree Left; 10 BinTree Right; 11 }; 12 13 BinTree CreatBinTree(); /* 实现细节忽略 */ 14 void PreorderPrintLeaves( BinTree BT ); 15 16 int main() 17 { 18 BinTree BT = CreatBinTree(); 19 printf("Leaf nodes are:"); 20 PreorderPrintLeaves(BT); 21 printf("\n"); 22 23 return 0; 24 } 25 void PreorderPrintLeaves( BinTree BT ){ 26 if(BT){ 27 if((BT->Left == NULL && BT->Right == NULL)){ 28 printf(" %c", BT->Data); 29 } 30 PreorderPrintLeaves(BT->Left); 31 PreorderPrintLeaves(BT->Right); 32 33 } 34 }