expectedoutputtwowaybinarytreeuos.txt

国外的数据结构与算法分析用书

BasicDictUos Demo for TwoWayBinaryTreeUos
Inserting... 23
Inserting... 1
Inserting... 4
Inserting... 18
Inserting... 2
Inserting... 102
Inserting... -50
current contents: 23 1 4 18 2 102 -50 
Inserting... 3
Inserting... 54
Inserting... -12
Inserting... -18
Inserting... 32
Current contents: 23 1 4 18 2 102 -50 3 54 -12 -18 32 
is it empty? false
Is it full? false
Has 3? true
Obtain 3: 3
Obtain 23: 23
Deleting 3
Has 3? false
Current contents:23 1 4 18 2 102 -50 54 -12 -18 32 
has 99? false
Is it full? false
Deleting 32
Deleting -18
Deleting -12
Deleting 54
Deleting -50
Deleting 102
Deleting 2
Deleting 18
Deleting 4
Deleting 1
Deleting 23
Wipe out
is it empty? true
Inserting.. 23
Obtain 23: 23
Deleting 23
is it empty? true
that's it

DictUos Demo forTwoWayBinaryTreeUos
Inserting... 23
Inserting... 1
Inserting... 4
Inserting... 23
Inserting... 18
Inserting... 2
Inserting... 23
Inserting... 102
Inserting... 23
Current contents: 23 1 4 23 18 2 23 102 23 
Frequency of 23? 4
Deleting 23
Frequency of 23? 3
Go first
Go forth
Insert 32

Search for 2: Item exists? true
2
Delete the Item
Iterate through the list:
23 1 4 23 18 23 102 32 Current contents: 23 1 4 23 18 23 102 32 
Current contents: 23 1 4 23 18 23 102 32 
Wipe out
is it empty? true
Inserting.. 23
Current contents: 23 
Frequency of 23? 1
Frequency of 9999? 0
Deleting 23
is it empty? true
that's it
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

Demo For BinaryTreeUos
Creating new tree with root 5
Go Root
Inserting..... 31
Inserting..... 12
Inserting..... 21
Inserting..... 15
Go Root
Inserting..... 18
Inserting..... 1
Inserting..... 33

     2: 21
1: 5
          3: 33
     2: 1
                    5: 12
               4: 31
                    5: 15
          3: 18
               4: -
Current Contents: 18 15 31 12 1 33 5 21 
Right Subtree: 
1: 21
Left Subtree: 
     2: 33
1: 1
               4: 12
          3: 31
               4: 15
     2: 18
          3: -
Frequency of 21 1
Frequency of 19 0
Search for..... 33
Item exists? true
Deleting Current Item
Current Contents18 15 31 12 1 5 21 
Search for..... 1
Item exists? true
Deleting Current Item
Current Contents18 15 31 12 5 21 
Search for..... 15
Item exists? true
Deleting Current Item
Current Contents18 31 12 5 21 
inorder traversal:
before--item exists?: false
18   31   12   5   21   
Demo For TwoWayBinaryTreeUos
Go Root
Inserting..... 21
Inserting..... 18
Inserting..... 4
Inserting..... 1
Inserting..... 33
Inserting..... 31
Inserting..... 12
seraching for 31
Go to 31's parent