二叉查找樹：對於樹中的每個節點X，它的左子數種所有關鍵字值小於X的關鍵字，而它的右子樹種所有關鍵字值大於X的關鍵字值。
TreeNode * TreeNode * /* _TREE_H */
(T !=->->
(T ==(X < T-> Find(X, T-> (X > T-> Find(X, T->
(T == (T->Left ==
FindMin(T->
(T !=(T->Right !== T->
(T === malloc(((T ==->Element =->Left = T->Right = (X < T->->Left = Insert(X, T-> (X > T->->Right = Insert(X, T->
T;
(T == (X < T->Element) ->Left = Delete(X, T-> (X > T->->Right = Delete(X, T-> (T->Left && T->Right) = FindMin(T->->Element = TmpCell->->Right = Delete(T->Element, T-> =(T->Left == NULL) = T-> (T->Right === T->
