二叉树的实现

二叉树的实现代码 /*LinkTree.h*/ typedef int DataType; //这样定义意味着节点中能放一个整数，但如果是非叶子节点则可以解读为对应的操作符的ascii struct Node; typedef Node* BinTree; //type of binary tree struct Node /* type of node*/ { DataType info; BinTree llink; BinTree rlink; }; BinTree createEmptyTree( void ); BinTree consBintree (DataType val, BinTree left, BinTree right); //construct a tree int isNull (BinTree tr); //find out if it is an empty tree BinTree leftChild(BinTree tr); //return the left child of the tree BinTree rightChild(BinTree tr); //return the right child of the tree DataType visitRoot(BinTree tr); //visit the root of the tree void preOrder( BinTree t); //travel pre order void postOrder( BinTree t); //travel post order void inOrder( BinTree t); //travel in order