Deadline : 2020/12/16 ==> extended to 2020/12/20 23:30 "Read before submission"
1.可新增一個整數資料 data (由使用者輸入) 進入 BST 中, 並且在新增完後以"遞迴方式"中序走訪BST,輸出中序走訪的數列 (應為排序後整數數列);
2.可以亂數新增 k 個整數資料,範圍在 0~range 之間 (可自行定義), 並將這 k 個資料新增至 BST , 全部新增完後,以中序走訪 BST 並輸出;
3. 自BST 中刪除一個整數資料 data (由使用者輸入)
1.Insert an integer data in binary search tree . After insertion, use "recursive approach" to traverse the tree and print these numbers (it should be in ascending order)
2.It can be randomly insert k integer data, and the range of the random integers can be assigned by user. After k th integer is inserted, traverse the tree by "inorder sequence" and print it .
3.Delete an integer number from BST (assigned by user) .
1.以前序走訪BST並且輸出 preorder sequence;
2.以後序走訪BST並且輸出 postorder sequence;
3.對 BST 做 階層走訪 (level order traversal);
4.其它⋯
1.Traverse BST using preorder sequence
2.Traverse BST using postorder sequence
3.Traverse BST using level order sequence
4. Other.....
Requirements
Bonus : Draw the BST