erchashu.rar_C++ erchashu_erchashu

#include <stdio.h> #include <stdlib.h> typedef struct Node { char data; struct Node *lchild; struct Node *rchild; }BiTreeNode, *BiTree; BiTree CreateBiTree(BiTree T)//创建二叉树 { char x; scanf("%c", &x); if ('0' == x) { T = NULL; } else { T = (BiTree) malloc (sizeof(BiTreeNode)); T->data = x; T->lchild = CreateBiTree(T->lchild); T->rchild = CreateBiTree(T->rchild); } return T; } void LaterOrderBiTree(BiTree T)//后序遍历 { if (NULL != T) { LaterOrderBiTree(T->lchild); LaterOrderBiTree(T->rchild); printf("%c ", T->data); } } void InOrderBiTree(BiTree T)//中序遍历 { if (NULL != T) { InOrderBiTree(T->lchild); printf("%c ", T->data); InOrderBiTree(T->rchild); } } void PreOrderBiTree(BiTree T)//前序遍历 { if (NULL != T) { printf("%c ", T->data); PreOrderBiTree(T->lchild); PreOrderBiTree(T->rchild); } } int main(void) { BiTree T = NULL; printf("请输入二叉树元素:\n"); printf("先输入节点元素，再输入左子树，最后右子树的顺序输入，\n输入0表示空（可以输入abcd00e00f00g00）\n"); printf(" a\n"); printf(" / \\ \n"); printf(" b g \n"); printf(" / \\ \n"); printf(" c f\n"); printf(" /\\\n"); printf(" d e\n"); T = CreateBiTree(T); printf("\n\n"); printf("先序遍历:\n"); PreOrderBiTree(T); printf("\n\n"); printf("中序遍历:\n"); InOrderBiTree(T); printf("\n\n"); printf("后序遍历:\n"); LaterOrderBiTree(T); printf("\n\n"); system("pause"); }