Comparable interface java

public class BinarySearchTree< T extends Comparable<T>> {
    Node root;
    class Node {
        T data;
        Node left;
        Node right;

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

    public boolean isEmpty() {
        return root == null;
    }

    public void insert(T value) {
        if(isEmpty())
            root = new Node(value);
        else
            insert(root, value);
    }

    private void insert(Node node, T value) {

        if(value.compareTo(node.data) < 0) {
            if(node.left == null)
                node.left = new Node(value);
            else
                insert(node.left, value);
        }
        else {
            if(node.right == null)
                node.right = new Node(value);
            else
                insert(node.right, value);
        }
    }

}

Source: stackoverflow.com

Similar codes

0 vote115 views1 answer
Spring yml property boolean
Java
0 vote116 views3 answers
Draw an item using System.out.println
Java
0 vote106 views4 answers
Java action every player bukkit
Java
16 votes64 views3 answers
Randomint java
Java
3 votes114 views1 answer
Howow to use font object Java
Java
11 votes122 views1 answer
Age in java
Java
26 votes145 views2 answers
Java random numbers in specific range
Java
0 vote127 views1 answer
Spring core xml configuration for collection using constructor
Java Spring
0 vote141 views1 answer
Plus One LeetCode Java
Java
1 vote114 views1 answer
Chenge font android studio
Java