worldinme的博客

查找的三个函数 Position Find(ElementType X, BinTree BST) Position FindMin(BinTree BST) Position FindMax(BinTree BST) Position Find(ElementType X, BinTree BST) { if (!BST) return NULL;/*查找失败*/ else if (X > BST->Data) return Find(X, BST->Right);/

先放定义 typedef struct TreeNode *BinTree; typedef BinTree Position; struct TreeNode{ ElemenType Data; BinTree Left; BinTree Right; }; 二叉树的中序非递归遍历 void InOrderTraversal(BinTree BT) { BinTree T=BT; Stack S=CreatStack(MaxSize); while(T||!isEmpty(S)){/