查找二叉树
以根节点为标准 1.左节点比根节点小
2.右节点比根节点大
定义节点
class TreeNode{
private int key;
private TreeNode leftChild;
private TreeNode rightChild;
private TreeNode parent;
private int data;
}
创建树
public TreeNode put (int data){
TreeNode node = null;
TreeNode parent = null;
if(root==null){
node = new TreeNode(0, data);
root = node;
return node;
}
node = root;
while(node!=null){
parent = node;
if(data > node.data){
node = node.rightChild;
}else if (data < node.data) {
node = node.leftChild;
}else{
return node;
}
}
node = new TreeNode(0, data);
if(data<parent.data){
parent.leftChild = node;
}else{
parent.rightChild = node;
}
node.parent = parent;
return node;
}
中序遍历
测试结果
打印结果