java通过键盘输入数据构造一棵二叉树返回树根节点对象

根据提供的引用内容，以下是一个示例代码，用于通过键盘输入数据构造一棵二叉树并返回树的根节点对象：

import java.util.Scanner;

public class BinaryTree {
    private Node root;

    private class Node {
        private int data;
        private Node leftChild;
        private Node rightChild;

        public Node(int data) {
            this.data = data;
            this.leftChild = null;
            this.rightChild = null;
        }
    }

    public void insert(int data) {
        root = insert(root, data);
    }

    private Node insert(Node node, int data) {
        if (node == null) {
            node = new Node(data);
        } else {
            if (data <= node.data) {
                node.leftChild = insert(node.leftChild, data);
            } else {
                node.rightChild = insert(node.rightChild, data);
            }
        }
        return node;
    }

    public Node getRoot() {
        return root;
    }

    public static void main(String[] args) {
        BinaryTree binaryTree = new BinaryTree();
        Scanner scanner = new Scanner(System.in);

        System.out.print("请输入树的节点数量：");
        int n = scanner.nextInt();

        System.out.println("请输入树的节点值：");
        for (int i = 0; i < n; i++) {
            int data = scanner.nextInt();
            binaryTree.insert(data);
        }

        Node root = binaryTree.getRoot();
        System.out.println("树的根节点值为：" + root.data);
    }
}