} treeNode;
+static
treeNode* NewTreeNode(treeNode* left, treeNode* right, long item)
{
treeNode* new;
return new;
} /* NewTreeNode() */
-
+static
long ItemCheck(treeNode* tree)
{
if (tree->left == NULL)
return tree->item + ItemCheck(tree->left) - ItemCheck(tree->right);
} /* ItemCheck() */
-
+static
treeNode* BottomUpTree(long item, unsigned depth)
{
if (depth > 0)
return NewTreeNode(NULL, NULL, item);
} /* BottomUpTree() */
-
+static
void DeleteTree(treeNode* tree)
{
if (tree->left != NULL)