摘要： public class BinaryTree { public Node root; public BinaryTree(Node root){ this.root = root; } public void insert(int x){ Node node = new Node(); node.key = x; Node current = root; Node parent = null; while(true){ parent = current; if(node.key < current.key){ //左孩子 current = curren... 阅读全文