手写二叉树(从实现,到遍历,查找,获取高度,结点数等方法)
项目工程文件:(包括节点类Node.java 接口类MyBTreeInterface.java 二叉树类MyBTree.java 和测试类MyBTree_test_1.java) Node.java 1 /* 2 二叉树的结点类 3 */ 4 public class Node { 5 public Object obj; 6 public Node leftNode; 7 public Node rightNode; 8 //构造方法 9 10 public Node(Object obj) { 11 this.obj = obj; 12 } 13 public Node(Object obj, Node leftNode, Node rightNode) { 14 this.obj = obj; 15 this.leftNode = leftNode; 16 this.rightNode = rightNode; 17 } 18 19 @Override 20 public String toString() { 21 return "Node{" + 22 "obj=" + obj + 23 ", leftNode=" + leftNode + 24 ", rightNode=" + rightNode + 25 '}'; 26 } 27 } 接口类