创建一个二叉树，实现二叉树的前序，中序，后序排列；输出二叉树的高度和前k个结点的值-Create a binary tree, the realization of binary tree, the preamble of the sequence, after the sequence arrangement The output of the binary tree height and the value of k node before