建立二叉树；对其进行遍历，遍历过程中输出结点的值；求出该二叉树的高度；并查询二叉树中是否

存在值为x的结点。

-Establish binary tree　its traverse, the output node during the traversal value　determined the height of the binary tree　and query the existence of a binary tree node value is x.