|
9
/ \
|
|
5 8
|
|
/ \ \
|
|
1 4 7
|
|
/ \ /
|
|
2 3 6
就是从最左边开始, 遍历五次,
1,
2,
3, 4, 5
6,
7, 8, 9,
最后结果是 1 2 3 4 5 6 7 8 9
加一个dummy node, with left child is the root node.
|
Morris post order traversal algorithm
原文：http://www.cnblogs.com/juliachenOnSoftware/p/4806102.html