二叉树的建立，非递归前中后序遍历，判断二叉树的相似，实现二叉树中左右子树的交换-The establishment of a binary tree, taken in the order of non-recursive traversal of binary tree similar to the judge, to achieve a binary tree in the exchange of left and right subtree