二叉树的创建于遍历

创建二叉树并以根结点为参数交换每个结点的左右子树，查找x结点并输出其所有的祖先结点，以中序遍历和前序遍历创建二叉树。-Create a binary tree and parameter exchange for each node of the root node to the left and right subtree, find x nodes and output nodes of all its ancestors, create a binary tree in order tra

此代码可以创建二叉树并求出叶子节点总数和节点总数-This code can create a binary tree and calculated the total number of leaf nodes and the total number of nodes