-
Notifications
You must be signed in to change notification settings - Fork 1
/
Replace with depth.cpp
61 lines (47 loc) · 1.55 KB
/
Replace with depth.cpp
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
57
58
59
60
61
/*
Replace with depth
You are given a generic tree. You have to replace each node with its depth value. You just have to update the data of each node, there is no need to
return or print anything.
Input format :
The first line of input contains data of the nodes of the tree in level order form. The order is: data for root node, number of children to root node,
data of each of child nodes and so on and so forth for each node. The data of the nodes of the tree is separated by space.
Output format:
The updated tree is printed level wise. Each level is printed in a new line. Please refer to sample output 1 for more details.
Constraints:
Time Limit: 1 sec
Sample Input 1:
10 3 20 30 40 2 40 50 0 0 0 0
Sample Output 1:
0
1 1 1
2 2
*/
/************************************************************
Following is the structure for the TreeNode class
template <typename T>
class TreeNode {
public:
T data;
vector<TreeNode<T>*> children;
TreeNode(T data) {
this->data = data;
}
~TreeNode() {
for (int i = 0; i < children.size(); i++) {
delete children[i];
}
}
};
************************************************************/
void replaceWithDepthValue(TreeNode<int>* root, int level = 0) {
// Write your code here
//corner case
if(root == NULL) {
return;
}
root -> data = level;
for(int i = 0; i < root -> children.size(); i++) {
replaceWithDepthValue(root -> children[i], level + 1);
}
return;
}