查找二叉树

public class Test {
    private static class Node{
        private Integer data;
        private Test.Node left;
        private Test.Node right;

        public Node() {
        }

        public Node(Integer data) {
            this.data = data;
        }
    }

    public static Node select(Node node,Integer target){
        if (node == null){
            return null;
        } else if (target == node.data){
            return node;
        } else if (target < node.data){
            return select(node.left, target);
        } else {
            return select(node.right,target);
        }
    }

    public static void main(String[] args) {
        Test.Node root = new Test.Node(8);
        root.left = new Test.Node(3);
        root.right = new Test.Node(10);
        root.left.left = new Test.Node(1);
        root.left.right = new Test.Node(6);
        root.right.left = new Test.Node(9);
        root.right.right = new Test.Node(14);

        System.out.println(select(root,6).data);
    }
}