五、用五個數字 6, 22, 27, 39, 21 來架構一棵後序走訪(Post-Order Travesal)的二元搜尋 樹(Binary Search Tree)。(10 分)