package binaryTrees1;

import static binaryTrees1.BinaryTreeInput.printBinaryTree;

import static binaryTrees1.BinaryTreeInput.takeTreeInputDetailed;

/*For a given a Binary Tree of integers, replace each of its data with the depth of the tree.

Root is at depth 0, hence the root data is updated with 0. Replicate the same further going down the in the depth of the given tree.

The modified tree will be printed in the in-order fashion.

Example:

Alt text

The above tree after updating will look like this:

Alt text

Output: 2 1 2 0 2 1 2 (printed in the in-order fashion)

Input Format:

The first and the only line of input will contain the node data, all separated by a single space. Since -1 is used as an indication whether the left or right node data exist for root, it will not be a part of the node data.

Output Format:

The first and the only line of output prints the updated tree in the in-order fashion.

Note:

You are not required to print anything explicitly. It has already been taken care of.

Constraints:

1 <= N <= 10^5

Where N is the total number of nodes in the binary tree.

Time Limit: 1sec

Sample Input 1:

2 35 10 2 3 5 2 -1 -1 -1 -1 -1 -1 -1 -1

Sample Output 1:

2 1 2 0 2 1 2

Sample Input 2:

1 2 3 4 5 6 7 -1 -1 -1 -1 -1 -1 -1 -1

Sample Output 2:

2 1 2 0 2 1 2 */

public class ReplaceNodeWithDepth {

public static void helperFunction(BinaryTreeNode<Integer> root, int level) {

if (root == null) return;

root.data = level;

helperFunction(root.left, level + 1);

helperFunction(root.right, level + 1);

}

public static void replaceNodeWithDepth(BinaryTreeNode<Integer> root) {

helperFunction(root, 0);

}

public static void main(String[] args) {

var root = takeTreeInputDetailed(true, 0, true);

System.out.println("----------The Tree is----------");

printBinaryTree(root);

System.out.println("-------------------------------");

replaceNodeWithDepth(root);

System.out.println("-------------------------------");

printBinaryTree(root);

}

}