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 vote125 views1 answer
If ternaire java
Java
2 votes90 views1 answer
Testing if editText is empty java
Java
2 votes113 views1 answer
Android coding how to open map
Java
0 vote117 views1 answer
Execution repackage of goal org.springframework.boot:spring-boot-maven-plugin:2.5.0:repackage failed:
Java
1 vote110 views1 answer
Java declare multilayred array values
Java
0 vote100 views1 answer
Bukkit plugin player variable
Java
0 vote99 views1 answer
Java spring boot json deserialize date inaccurate
Java
1 vote122 views2 answers
Java join list of strings
Java
0 vote108 views1 answer
Fast Search in java
Java
0 vote93 views1 answer
Jgit clone in memory
Java