//二叉树的前序、中序递归遍历与先序生成 #include <bits/stdc++.h> using namespace std; typedef struct TNode *PtrToTNode; typedef PtrToTNode BinTree; typedef char ElementType; struct TNode{ ElementType Data; BinTree Left; BinTree Right; }; //二叉树的先序递归遍历 void PreorderTraversal(BinTree BT){ if(BT){ printf("%c ",BT->Data); PreorderTraversal(BT->Left); PreorderTraversal(BT->Right); } } //二叉树的中序递归遍历 void InOrderTraversal(BinTree BT){ if(BT){ InOrderTraversal(BT->Left); printf("%c ",BT->Data); InOrderTraversal(BT->Right); } } BinTree CreateBinTreeNode(ElementType X){ BinTree node = (BinTree)malloc(sizeof(struct TNode)); node->Data = X; node->Left = NULL; node->Right = NULL; return node; } BinTree PreCreateBinTree(){ ElementType X; scanf("%c",&X); if(X==' '){ return NULL; } else{ BinTree BT = CreateBinTreeNode(X); BT->Left = PreCreateBinTree(); BT->Right = PreCreateBinTree(); return BT; } } //释放二叉树所有结点内存 void FreeBinTree(BinTree BT){ if(BT){ BinTree BTL=BT->Left,BTR=BT->Right; free(BT); BT = NULL; FreeBinTree(BTL); FreeBinTree(BTR); } } int main(){ BinTree BT = PreCreateBinTree(); PreorderTraversal(BT); cout << endl; InOrderTraversal(BT); cout << endl; InOrderTraversal(BT); FreeBinTree(BT); return 0; }
0.0分
2 人评分
本人酷爱递归实现很多问题,这里也是浏览:556 |
剪刀石头布 (C语言代码)浏览:752 |
C语言程序设计教程(第三版)课后习题9.8 (C语言代码)浏览:665 |
P1000 (C语言代码)浏览:874 |
1054题解浏览:467 |
2006年春浙江省计算机等级考试二级C 编程题(2) (C语言代码)浏览:344 |
蛇行矩阵 (C语言代码)浏览:502 |
复数求和 (C语言代码)浏览:924 |
C语言程序设计教程(第三版)课后习题12.3 (C语言代码)浏览:547 |
青年歌手大奖赛_评委会打分 (C语言代码)浏览:2143 |