题目详情

java.lang.reflect.InvocationTargetException;

import

java.lang.reflect.Method;import

net.mooctest.AbstractBinarySearchTree.Node;public

class

AbstractSelfBalancingBinarySearchTreeTest

{private

ScapegoatTree();AbstractBinarySearchTree.Node

scapegoatTree0.createNode((-3252),(AbstractBinarySearchTree.Node)

null,

(AbstractBinarySearchTree.Node)

null,(AbstractBinarySearchTree.Node)

null);AbstractBinarySearchTree.Node

new

AbstractBinarySearchTree.Node(abstractBinarySearchTree_Node0.value,

abstractBinarySearchTree_Node0,

abstractBinarySearchTree_Node0,abstractBinarySearchTree_Node0);AbstractBinarySearchTree.Node

scapegoatTree0.rotateRight(abstractBinarySearchTree_Node1);scapegoatTree0.rotateLeft(abstractBinarySearchTree_Node1);AbstractBinarySearchTree.Node

scapegoatTree0.rotateRight(abstractBinarySearchTree_Node2);assertTrue(abstractBinarySearchTree_Node1.isLeaf());assertSame(abstractBinarySearchTree_Node0,

abstractBinarySearchTree_Node3);*/}@Testpublic

void

ScapegoatTree();AbstractBinarySearchTree.Node

Node0

AbstractBinarySearchTree.Node(1,null,null,null);AbstractBinarySearchTree.Node

Node1

AbstractBinarySearchTree.Node(null,null,Node0,Node0);assertTrue(Node0.isLeaf());assertTrue(Node0.isLeaf());assertNotEquals(Node0.hashCode(),31);assertEquals(Node1.hashCode(),31);}@Testpublic

void

AbstractBinarySearchTree.Node(1,null,null,null);AbstractBinarySearchTree.Node

Node1

AbstractBinarySearchTree.Node(null,null,Node0,Node0);AbstractBinarySearchTree.Node

Node3

AbstractBinarySearchTree.Node(null,null,Node0,Node0);AbstractBinarySearchTree.Node

Node2

AbstractBinarySearchTree.Node(2,null,null,null);AbstractBinarySearchTree.Node

Node4

AbstractBinarySearchTree.Node(2,null,null,null);assertTrue(Node1.equals(Node1));assertFalse(Node1.equals(null));assertFalse(Node1.equals("z1"));assertFalse(Node1.equals(Node0));assertTrue(Node1.equals(Node3));assertTrue(Node2.equals(Node4));assertFalse(Node0.equals(Node1));assertFalse(Node0.equals(Node2));}@Testpublic

void

ScapegoatTree();AbstractBinarySearchTree.Node

Node00

AbstractBinarySearchTree.Node(null,null,null,null);AbstractBinarySearchTree.Node

Node0

AbstractBinarySearchTree.Node(1,null,null,null);AbstractBinarySearchTree.Node

Node1

AbstractBinarySearchTree.Node(1,null,Node0,Node0);//Node2节点只有右子树AbstractBinarySearchTree.Node

Node2

AbstractBinarySearchTree.Node(1,null,null,Node0);//Node3节点只有左子树AbstractBinarySearchTree.Node

Node3

AbstractBinarySearchTree.Node(1,null,Node0,null);//Node4节点有左子树和右子树但值为nullAbstractBinarySearchTree.Node

Node4

AbstractBinarySearchTree.Node(null,null,Node0,Node0);//Node5节点有左子树和右子树但值为null且左右子树节点为nullAbstractBinarySearchTree.Node

Node5

AbstractBinarySearchTree.Node(null,null,Node00,Node00);//Node6节点有左子树和右子树但值为null且左右子树节点为null,右子树节点有右子树与左子树AbstractBinarySearchTree.Node

Node6

AbstractBinarySearchTree.Node(null,null,Node4,Node4);st1.printSubtree(Node1);st1.printSubtree(Node2);st1.printSubtree(Node3);st1.printSubtree(Node4);st1.printSubtree(Node5);st1.printSubtree(Node6);}@Testpublic

void

ScapegoatTree();AbstractBinarySearchTree.Node

Node00

AbstractBinarySearchTree.Node(null,null,null,null);AbstractBinarySearchTree.Node

Node0

AbstractBinarySearchTree.Node(1,null,null,null);AbstractBinarySearchTree.Node

Node1

AbstractBinarySearchTree.Node(1,null,Node0,Node0);AbstractBinarySearchTree.Node

Node2

AbstractBinarySearchTree.Node(1,null,Node0,null);AbstractBinarySearchTree.Node

Node3

AbstractBinarySearchTree.Node(1,null,null,Node0);assertFalse(Node1.isLeaf());assertTrue(Node00.isLeaf());assertFalse(Node2.isLeaf());assertFalse(Node3.isLeaf());}@Testpublic

void

ScapegoatTree();AbstractBinarySearchTree.Node

Node00

AbstractBinarySearchTree.Node(null,null,null,null);AbstractBinarySearchTree.Node

Node0

AbstractBinarySearchTree.Node(1,null,null,null);AbstractBinarySearchTree.Node

Node1

AbstractBinarySearchTree.Node(1,null,Node0,Node0);AbstractBinarySearchTree.Node

Node2

AbstractBinarySearchTree.Node(1,null,Node0,null);AbstractBinarySearchTree.Node

Node3

AbstractBinarySearchTree.Node(1,null,null,Node0);assertEquals(Node0,st1.getMaximum(Node1));assertEquals(Node0,st1.getMinimum(Node1));}@Testpublic

void

ScapegoatTree();AbstractBinarySearchTree.Node

Node00

AbstractBinarySearchTree.Node(null,null,null,null);AbstractBinarySearchTree.Node

Node0

AbstractBinarySearchTree.Node(1,null,null,null);AbstractBinarySearchTree.Node

Node1

AbstractBinarySearchTree.Node(1,null,Node0,Node0);AbstractBinarySearchTree.Node

Node2

AbstractBinarySearchTree.Node(1,null,Node0,null);AbstractBinarySearchTree.Node

Node3

AbstractBinarySearchTree.Node(1,null,null,Node0);assertEquals(Node0,st1.getSuccessor(Node1));}@Testpublic

void

ScapegoatTree();AbstractBinarySearchTree.Node

Node00

AbstractBinarySearchTree.Node(null,null,null,null);