二叉樹的建立與遍曆(C語言實現)

標籤：

#include<stdio.h>#include<stdlib.h>typedef struct TreeNode//二叉樹節點聲明{int value;TreeNode* left;TreeNode* right;}*PtrNode;void CreatTree(PtrNode *root)//先序建立一個樹{int tmp;scanf("%d",&tmp);if(tmp==-1)*root=NULL;else{*root=(PtrNode)malloc(sizeof(TreeNode));(*root)->value=tmp;printf("請輸入左節點:");CreatTree(&(*root)->left);printf("請輸入右節點:");CreatTree(&(*root)->right);}}void PreOrder(PtrNode root)//前序走訪{if(root==NULL)return;printf("%d ",root->value);PreOrder(root->left);PreOrder(root->right);}void InOrder(PtrNode root)//中序遍曆{if(root==NULL)return;InOrder(root->left);printf("%d ",root->value);InOrder(root->right);}void PostOrder(PtrNode root)//後序遍曆{if(root==NULL)return;PostOrder(root->left);PostOrder(root->right);printf("%d ",root->value);}int main(){PtrNode root;CreatTree(&root);PreOrder(root);printf("\n");return 0;}

二叉樹的建立與遍曆(C語言實現)