建立二叉树；对其进行遍历，遍历过程中输出结点的值；求出该二叉树的高度；并查询二叉树中是否 存在值为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.

参数较少，全局搜索能力很强，果蝇算法在离散问题和连续问题上具有很好的应用-Fewer parameters, strong global search ability, Drosophila algorithm in the discrete problem and continuous problem has a very good application