java 二叉树的简单实现\递归\CompareTo

二叉树

package datastructure;

public class BinaryTree<T> {
   
    private Node root;

    public Node getRoot() {
   
        return root;
    }
	//定义Node类
    private class Node{
   
        private T data;
        private Node lift;
        private Node right;
        private Node(T a){
   
            this.data = a;
        }
    }
    //递归,将data加到node的左或又孩子中
    private void addNode(Node node,T data){
   
        if(((Comparable)data).compareTo(node.data) < 0