Berkeley CS 61B Data Structures(in Java) Lab9 讨论帖

Lab9

Testing removeLeaf().  Removing one node from 6-node tree.

Removing another node from 5-node tree.

Attempting to remove non-leaf node from 4-node tree.

  Operation should have no effect.

Attempting to remove invalid node from 4-node tree.

The tree looks like this:

1

  12

  13

    131

[The above sequence should be 1, 12, 13, 131.]

Removing remaining nodes from 4-node tree.

还是Lab和蔼可亲，即将奔赴Project2，内心还是很慌的…

Creating 2-node tree.
Testing parent().

Testing insertChild().  Adding two more nodes to the 2-node tree.
Adding two more nodes to the 4-node tree.
This node is invalid, cannot insert a child.
  ERROR:  insertChild() failed to throw exception on invalid node.
The tree looks like this:
1
  11
  12
  13
    131
    132
[The above sequence should be 1, 11, 12, 13, 131, 132.]

Testing removeLeaf().  Removing one node from 6-node tree.
Removing another node from 5-node tree.
Attempting to remove non-leaf node from 4-node tree.
  Operation should have no effect.
Attempting to remove invalid node from 4-node tree.
The tree looks like this:
1
  12
  13
    131
[The above sequence should be 1, 12, 13, 131.]
Removing remaining nodes from 4-node tree.

Process finished with exit code 0

lab也来回复一下吧

打卡！感觉自己coding能力还是好弱

我上的是2014年的 所以是Lab10

1. D:\Git\DSA\CS61B\lab10>java -ea tree.SibTree
   
2. Creating 2-node tree.
   
3. Testing parent().
   
4. 
   
5. Testing insertChild().  Adding two more nodes to the 2-node tree.
   
6. Adding two more nodes to the 4-node tree.
   
7. The tree looks like this:
   
8. 1
   
9.   11
   
10.   12
    
11.   13
    
12.     131
    
13.     132
    
14. [The above sequence should be 1, 11, 12, 13, 131, 132.]
    
15. 
    
16. Testing removeLeaf().  Removing one node from 6-node tree.
    
17. Removing another node from 5-node tree.
    
18. Attempting to remove non-leaf node from 4-node tree.
    
19.   Operation should have no effect.
    
20. Attempting to remove invalid node from 4-node tree.
    
21. The tree looks like this:
    
22. 1
    
23.   12
    
24.   13
    
25.     131
    
26. [The above sequence should be 1, 12, 13, 131.]
    
27. Removing remaining nodes from 4-node tree.

复制代码

Lab10打卡。