Print Nodes K Distance Away

I/P:

19 50 25 12 n n 37 30 n n n 75 62 n 70 n n 87 n n 37 2

O/P:

12 50

https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree/

package pep.Day32;

import java.io.*;
import java.util.*;

public class Print_Nodes_K_Distance_Away {
    public static class Node {
        int data;
        Node left;
        Node right;

        Node(int data, Node left, Node right) {
            this.data = data;
            this.left = left;
            this.right = right;
        }
    }

    public static class Pair {
        Node node;
        int state;

        Pair(Node node, int state) {
            this.node = node;
            this.state = state;
        }
    }

    public static Node construct(Integer[] arr) {
        Node root = new Node(arr[0], null, null);
        Pair rtp = new Pair(root, 1);

        Stack<Pair> st = new Stack<>();
        st.push(rtp);

        int idx = 0;
        while (st.size() > 0) {
            Pair top = st.peek();
            if (top.state == 1) {
                idx++;
                if (arr[idx] != null) {
                    top.node.left = new Node(arr[idx], null, null);
                    Pair lp = new Pair(top.node.left, 1);
                    st.push(lp);
                } else {
                    top.node.left = null;
                }

                top.state++;
            } else if (top.state == 2) {
                idx++;
                if (arr[idx] != null) {
                    top.node.right = new Node(arr[idx], null, null);
                    Pair rp = new Pair(top.node.right, 1);
                    st.push(rp);
                } else {
                    top.node.right = null;
                }

                top.state++;
            } else {
                st.pop();
            }
        }

        return root;
    }

    public static void display(Node node) {
        if (node == null) {
            return;
        }

        String str = "";
        str += node.left == null ? "." : node.left.data + "";
        str += " <- " + node.data + " -> ";
        str += node.right == null ? "." : node.right.data + "";
        System.out.println(str);

        display(node.left);
        display(node.right);
    }

    public static void printKNodesFar(Node node, int data, int k) {
        // write your code here
        List<Node> path = findNodeToRootPath(node, data);

        for (int i = 0; i < path.size(); i++) {
            printKLevelsDown(path.get(i), k - i, i == 0 ? null : path.get(i - 1));
        }

    }

    public static void printKLevelsDown(Node node, int k, Node blocker) {
        if (node == null || node == blocker)
            return;
        else if (k == 0)
            System.out.println(node.data);
        printKLevelsDown(node.left, k - 1, blocker);
        printKLevelsDown(node.right, k - 1, blocker);
    }


    public static List<Node> findNodeToRootPath(Node node, int data) {
        if (node == null)
            return new ArrayList<Node>();
        if (node.data == data) {
            List<Node> path = new ArrayList<>();
            path.add(node);
            return path;
        }
        if (node.left != null) {
            List<Node> left = findNodeToRootPath(node.left, data);
            if (left.size() > 0) {
                left.add(node);
                return left;
            }
        }
        if (node.right != null) {
            List<Node> right = findNodeToRootPath(node.right, data);
            if (right.size() > 0) {
                right.add(node);
                return right;
            }
        }
        return new ArrayList<Node>();
    }

    public static void main(String[] args) throws Exception {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int n = Integer.parseInt(br.readLine());
        Integer[] arr = new Integer[n];
        String[] values = br.readLine().split(" ");
        for (int i = 0; i < n; i++) {
            if (values[i].equals("n") == false) {
                arr[i] = Integer.parseInt(values[i]);
            } else {
                arr[i] = null;
            }
        }

        int data = Integer.parseInt(br.readLine());
        int k = Integer.parseInt(br.readLine());

        Node root = construct(arr);
        printKNodesFar(root, data, k);
    }

}