treeNode           51 test/bench/shootout/binary-tree.c treeNode* NewTreeNode(treeNode* left, treeNode* right, long item)
treeNode           53 test/bench/shootout/binary-tree.c     treeNode*    new;
treeNode           55 test/bench/shootout/binary-tree.c     new = (treeNode*)malloc(sizeof(treeNode));
treeNode           65 test/bench/shootout/binary-tree.c long ItemCheck(treeNode* tree)
treeNode           74 test/bench/shootout/binary-tree.c treeNode* BottomUpTree(long item, unsigned depth)
treeNode           88 test/bench/shootout/binary-tree.c void DeleteTree(treeNode* tree)
treeNode          103 test/bench/shootout/binary-tree.c     treeNode   *stretchTree, *longLivedTree, *tempTree;