題目如下
Draw a tree that is both complete binary search tree and a complete
binary tree with exactly 11 nodes.
Use keys from the integers 1 through 11 (each appearing exactly once)
想請問大家
題目在講畫1顆樹從1到11要滿足二元完整樹和二元搜尋樹
但用紅黑樹和AVL樹畫也無法滿足此題目
請問是要用什麼方法解呢??
非常感謝大家!
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 220.134.38.221