假设树以儿子兄弟链表的方法存储，试分别设计实现它的前序，后序和层次遍历的算法-Hypothesis trees to son brother list of method storage, test design and realize it before the respectively sequence, sequence and after level traversal of the algorithm