Diagonal_Traversal_of_Binary_Tree.java

// { Driver Code Starts
//Initial Template for Java

//Contributed by Sudarshan Sharma
import java.util.LinkedList;
import java.util.Queue;
import java.io.*;
import java.util.*;

class Node {
  int data;
  Node left;
  Node right;

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

class GfG {

  static Node buildTree(String str) {

    if (str.length() == 0 || str.charAt(0) == 'N') {
      return null;
    }

    String ip[] = str.split(" ");
    // Create the root of the tree
    Node root = new Node(Integer.parseInt(ip[0]));
    // Push the root to the queue

    Queue<Node> queue = new LinkedList<>();

    queue.add(root);
    // Starting from the second element

    int i = 1;
    while (queue.size() > 0 && i < ip.length) {

      // Get and remove the front of the queue
      Node currNode = queue.peek();
      queue.remove();

      // Get the current node's value from the string
      String currVal = ip[i];

      // If the left child is not null
      if (!currVal.equals("N")) {

        // Create the left child for the current node
        currNode.left = new Node(Integer.parseInt(currVal));
        // Push it to the queue
        queue.add(currNode.left);
      }

      // For the right child
      i++;
      if (i >= ip.length)
        break;

      currVal = ip[i];

      // If the right child is not null
      if (!currVal.equals("N")) {

        // Create the right child for the current node
        currNode.right = new Node(Integer.parseInt(currVal));

        // Push it to the queue
        queue.add(currNode.right);
      }
      i++;
    }

    return root;
  }

  static void printInorder(Node root) {
    if (root == null)
      return;

    printInorder(root.left);
    System.out.print(root.data + " ");

    printInorder(root.right);
  }

  public static void main(String[] args) throws IOException {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

    int t = Integer.parseInt(br.readLine());

    while (t-- > 0) {
      String s = br.readLine();
      Node root = buildTree(s);
      Tree g = new Tree();
      ArrayList<Integer> diagonalNode = g.diagonal(root);
      for (int i = 0; i < diagonalNode.size(); i++) {
        System.out.print(diagonalNode.get(i) + " ");
      }
      System.out.println();
    }
  }
}


class Tree {
  public ArrayList<Integer> diagonal(Node root) {
    TreeMap<Integer, ArrayList<Integer>> map = new TreeMap<>();
    printDiagonalUtil(root, 0, map);
    ArrayList<Integer> ans = new ArrayList<Integer>();
    for (Map.Entry<Integer, ArrayList<Integer>> e : map.entrySet()) {
      for (int i = 0; i < e.getValue().size(); i++) {
        ans.add(e.getValue().get(i));
      }
    }
    return ans;
  }

  public void printDiagonalUtil(Node root, int d, TreeMap<Integer, ArrayList<Integer>> map) {
    if (root == null) {
      return;
    }
    ArrayList<Integer> k = map.get(d);
    if (k == null) {
      k = new ArrayList<Integer>();
      k.add(root.data);
    } else {
      k.add(root.data);
    }
    map.put(d, k);
    printDiagonalUtil(root.left, d + 1, map);
    printDiagonalUtil(root.right, d, map);
  }
}