//二叉树的前序、中序递归遍历与先序生成 #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 人评分
破解简单密码 (C语言代码)浏览:1766 |
母牛的故事 (C语言代码)浏览:435 |
C语言训练-求s=a+aa+aaa+aaaa+aa...a的值 (C语言代码)浏览:691 |
【金明的预算方案】 (C++代码)浏览:843 |
大家好,我是验题君浏览:577 |
交换Easy (C语言代码)浏览:761 |
计算质因子 (C语言代码)浏览:707 |
JAM计数法 (C语言代码)浏览:671 |
【计算球体积】 (C语言代码)浏览:1550 |
2003年秋浙江省计算机等级考试二级C 编程题(1) (C语言代码)浏览:615 |