作者mimi9126 (烦呀)
看板b98902HW
标题[计程] pre/post-order traversal
时间Thu Dec 17 21:21:48 2009
今天讲的有一点错误
给定binary tree的pre-order和post-order presentation以後，还是有可能有
multiple solution，就是如果像这种
pre: ab
post: ba
那这颗tree的root是a没有疑问，但b有可能是a的左子树也可能是右子树
是要给in-order，和pre-order或是pre-order其中一个才能唯一决定
--
We know. The time of joy will pass again someday.
Then, fresh wind blows. It treasures that is happy.
too, to be sad, too. Let's repeat it eternally, and live, and go!!
maybe happy...
--
※ 发信站: 批踢踢实业坊(ptt.cc)
◆ From: 140.112.218.141
1F：推 s864372002:"pre-order或pre-order" ||| 12/17 21:52
2F：推 s864372002:若计算树的话只要pre-order或post-order其一即可ˊˇˋ 12/17 21:53
3F：→ mimi9126:阿看得懂就好啦=皿= 12/17 23:34