伸展树(三)之 Java的实现(六)
System.out.printf("\n== 旋转节点(%d)为根节点\n", i);
39 tree.splay(i);
40 System.out.printf("== 树的详细信息: \n");
41 tree.print();
42
43 // 销毁二叉树
44 tree.clear();
45 }
46 }
复制代码
在二叉查找树的Java实现中，使用了泛型，也就意味着它支持任意类型；但是该类型必须要实现Comparable接口。
伸展树的Java测试程序
伸展树的测试程序运行结果如下：
复制代码
== 依次添加: 10 50 40 30 20 60
== 前序遍历: 60 30 20 10 50 40
== 中序遍历: 10 20 30 40 50 60
== 后序遍历: 10 20 40 50 30 60
== 最小值: 10
== 最大值: 60
== 树的详细信息:
60 is root
30 is 60's left child
20 is 30's left child
10 is 20's left child
50 is 30's right child
40 is 50's left child
== 旋转节点(30)为根节点
== 树的详细信息:
30 is root
20 is 30's left child
10 is 20's left child
60 is 30's right child
50 is 60's left child
40 is 50's left child