java - 比较已实现可比较的类的对象

Question

我正在学习二叉搜索树并尝试用 Java 实现它。

    public class BinarySearchTree<T>
    {
        private class Node
        {
            public T data;
            public Node left;
            public Node right;
        }

        //some code goes here

        public void insert(T data)
        {
            //make a new node and add data to that node
            //call to recursive function
        }
        private Node ins(Node root,Node toBeInserted)
        {
            if(root==null) { root = tobeInserted; return root; }

            //problem is here...
            else if(toBeInserted.data<=root.data)// <----How to do this ?????
                root = ins(root.left,toBeInserted);
            else
                root = ins(root.right,toBeInserted);
            return root;
        }
        //some more code
    }

问题是如何比较T类的对象？如果我在某个类 T 中实现了可比较，那么如何比较存储在左右节点中的数据？？？

提前致谢。

Answer 1

如果T始终实现Comparable，您可以在其定义中添加适当的绑定(bind):

public class BinarySearchTree<T extends Comparable<T>> { ... }

然后你可以使用compareTo():

toBeInserted.data.compareTo(root.data) <= 0