实现二叉树对称根周游的递归计算，按先根次序周游的顺序输入结点的信息,生成一个双链存储的二叉树的过程-Binary tree symmetric recursive computation of the root of traveling around the first root of the order of traveling around the order of input nodes, to generate a double-stranded storage of the binar