任意有根树遍历

左孩子右兄弟的存储方式

typedef struct tree_node{
    ElemType data;
    tree_node *left_child;
    tree_node *right_sibling;
} tree_node, *ptree_node;

先根遍历
PREORDER(T)

if T == NIL
    return NIL
print(T)
for p = T.left_child; p != NIL, p = p.right_sigling
    PREORDER(T)

参考博客网址:
http://blog.chinaunix.net/uid-21712186-id-1818095.html