C语言二叉树三种遍历算法及其广义表表示 VS2012编写 基于先序遍历的构造算法：输入是二叉树的先序序列，但必须在其中加入虚结点以示空指针的位置。假设虚结点输入时用’.’字符表示。 分别利用先序遍历、中序遍历、后序遍历所建二叉树-Three kinds of C language binary tree traversal algorithm and generalized table said visual programming based on first order traversal algorithm to construct the input is binary tree preorder sequence, but must add the virtual node to show the location of the null pointer. Assuming the virtual node to enter the　.　character. The use of the first traversal, in order traversal, after the two tree traversal traversal