Coding-Ninjas/PrintBSTkeysinrange.java at master · kumarvivek8/Coding-Ninjas · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
class Node {

    int data;
    Node left, right;

    Node(int d) {
        data = d;
        left = right = null;
    }
}

class BinaryTree {

    static Node root;


    void Print(Node node, int k1, int k2) {


        if (node == null) {
            return;
        }


        if (k1 < node.data) {
            Print(node.left, k1, k2);
        }


        if (k1 <= node.data && k2 >= node.data) {
            System.out.print(node.data + " ");
        }


         Print(node.right, k1, k2);
    }

    public static void main(String[] args) {
        BinaryTree tree = new BinaryTree();
        int k1 = 10, k2 = 25;
        tree.root = new Node(20);
        tree.root.left = new Node(8);
        tree.root.right = new Node(22);
        tree.root.left.left = new Node(4);
        tree.root.left.right = new Node(12);

        tree.Print(root, k1, k2);
    }
}