二叉树的先序、中序、后序遍历

typedef struct TreeNode *BinTree; typedef BinTree Position; struct TreeNode{ ElementType Data; BinTree Left; BinTree Right; }; BinTree BT; //二叉树的遍历 void PreOrderTraversal(BinTree BT)//(1)先序遍历 { if(BT){ printf("%d",BT->Data); PreOrderTraversal(BT->Left); PreOrderTraversal(BT->Right); } } void InOrderTraversal(BinTree BT)//(2)中序遍历 { if(BT){ InOrderTraversal(BT->Left); printf("%d",BT->Data); InOrderTraversal(BT->Right); } } void PostOrderTraversal(BinTree BT)//(3)后序遍历 { if(BT){ PostOrderTraversal(BT->Left); PostOrderTraversal(BT->Right); printf("%d",BT->Data); } }