Data-Structures-and-Algorithms/Print-all-Nodes-that-dont-have-Sibling.java at main · kinshuk-code-1729/Data-Structures-and-Algorithms · 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
50
51
52
53
54
55
56
//User function Template for Java

/*  A Binary Tree nodea
class Node
{
    int data;
    Node left, right;

    Node(int item)
    {
        data = item;
        left = right = null;
    }
}
*/
class Tree
{
    ArrayList<Integer> arrLst;
    ArrayList<Integer> noSibling(Node node)
    {
        // code here
        arrLst = new ArrayList<>();
        dfs(node, arrLst);

        if(arrLst.isEmpty()){
            arrLst.add(-1);
        }

        Collections.sort(arrLst);

        return arrLst;

    }

    void dfs(Node root, ArrayList<Integer> arrLst){
        if(root == null){
            return;
        }

        if(root.left == null && root.right == null){
            return;
        }

        if(root.left == null && root.right != null){
            arrLst.add(root.right.data);
        }

        else if(root.left != null && root.right == null){
            arrLst.add(root.left.data);
        }

        dfs(root.left, arrLst);
        dfs(root.right, arrLst);

    }
}