一个二叉树的实现
package mynode; public class Node { public int iData; public double dData; public Node leftChild; public Node rightChild; @Override public String toString() { return "Node{" + "iData=" + iData + ", dData=" + dData + '}'; } public void display() { System.out.println(this.toString()); } } package mynode; public class Tree { private Node root; public Tree() { root = null; } public Node find(int key) { Node current = root; while (current.iData != key) { if(key < current.iData) { current = current.leftChild; } else { current = current.rightChild; } if (current == null){ return null; } } return