6-11 先序输出叶结点 (15 分) 数据结构与算法题目集(中文)
发布时间:2020-12-14 05:10:26 所属栏目:大数据 来源:网络整理
导读:本题要求按照先序遍历的顺序输出给定二叉树的叶结点。 函数接口定义: void PreorderPrintLeaves( BinTree BT ); 其中 BinTree 结构定义如下: typedef struct TNode *Position;typedef Position BinTree;struct TNode{ ElementType Data; BinTree Left; Bin
本题要求按照先序遍历的顺序输出给定二叉树的叶结点。 函数接口定义:void PreorderPrintLeaves( BinTree BT ); 其中 typedef struct TNode *Position; typedef Position BinTree; struct TNode{ ElementType Data; BinTree Left; BinTree Right; }; 函数 裁判测试程序样例:#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; } /* 你的代码将被嵌在这里 */ 输出样例(对于图中给出的树):
#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 Insert(BinTree T,ElementType X) { if(T == NULL) { T = (BinTree)malloc(sizeof(TNode)); T -> Left = T -> Right = NULL; T -> Data = X; } else if(X < T -> Data) { T -> Left = Insert(T -> Left,X); } else { T -> Right = Insert(T -> Right,X); } return T; } BinTree CreatBinTree(); void PreorderPrintLeaves( BinTree BT ); int main() { BinTree BT = CreatBinTree(); printf("Leaf nodes are:"); PreorderPrintLeaves(BT); printf("n"); return 0; } BinTree CreatBinTree() { BinTree Bt = NULL; int n; ElementType ch; scanf("%d",&n); for(int i = 0;i < n;i ++) { getchar(); scanf("%c",&ch); Bt = Insert(Bt,ch); } return Bt; } void PreorderPrintLeaves( BinTree BT ) { BinTree b[100]; int c = 0; if(BT) b[c ++] = BT; while(c != 0) { BinTree temp = b[-- c]; if(!(temp -> Left || temp -> Right)) printf(" %c",temp -> Data); if(temp -> Right) b[c ++] = temp -> Right; if(temp -> Left) b[c ++] = temp -> Left; } } (编辑:李大同) 【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容! |