expectedoutputbasicbinarytreeuos.txt

来自「国外的数据结构与算法分析用书」· 文本 代码 · 共 46 行

Testing routines of SimpleTreeUos
inserted 3, 6, 10
inserted 2, 4, 9, 11
Root value? 6
Left value? 3
Right value? 10
Left Left value? 2
Right Left value? 4
Left Right value? 7
Right Right value? 11
That's it.
Demo for BasicBinaryTreeUos
Inserting 10....
Inserting 5....
Inserting 6....
Current Contents: 6 5 10 
Delete Root
Current Contents: 5 10 
Inserting 7....
Inserting 12....
Inserting 14....
Inserting 21....
Inserting 10....
Inserting 5....
Current Contents: 5 10 5 10 7 12 14 21 
Delete Root
Current Contents: 10 5 10 7 12 14 21 
Delete Root
Current Contents: 5 10 7 12 14 21 
Delete Root
Current Contents: 5 10 7 12 14 
Is full? false
is empty? false
Apperance of tree:

     2: -
1: 14
          3: -
     2: 12
               4: -
          3: 7
                    5: 10
               4: 5
                    5: -
Wipe Out