[問題] 前後序求二元樹
Given a binary tree T whose pre-order and post-order sequence are "9, 8 ,6, 1
4, 7, 5, 3, 2" and "1, 4, 6, 7, 8, 3, 2, 5, 9" respectively.
(a) Draw T.
(b) Is T unique ? Why ?
(c) Is T a max heap ? Why ?
我知道只給予前中或後中就可以畫出一顆二元樹,但是如果只給前序和後序,那麼怎麼
畫出這一顆二元樹呢 ?
請指教了,謝謝。
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 163.18.32.143
推
04/09 21:55, , 1F
04/09 21:55, 1F
→
04/09 22:29, , 2F
04/09 22:29, 2F
→
04/09 22:30, , 3F
04/09 22:30, 3F
→
04/09 22:30, , 4F
04/09 22:30, 4F
推
04/09 23:03, , 5F
04/09 23:03, 5F
→
04/09 23:03, , 6F
04/09 23:03, 6F
→
04/09 23:05, , 7F
04/09 23:05, 7F
→
04/09 23:05, , 8F
04/09 23:05, 8F
討論串 (同標題文章)