/
Sum_Tree.java
116 lines (87 loc) · 2.39 KB
/
Sum_Tree.java
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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
// { Driver Code Starts
//Initial Template for Java
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;
}
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);
Solution g = new Solution();
if (g.isSumTree(root) == true)
System.out.println(1);
else
System.out.println(0);
t--;
}
}
}
class Solution {
boolean isSumTree(Node root) {
if (root == null)
return true;
if (root.left == null && root.right == null)
return true;
return isSumTree(root.left) && isSumTree(root.right) && (sum(root.left) + sum(root.right) == root.data);
}
int sum(Node root) {
if (root == null)
return 0;
return root.data + sum(root.left) + sum(root.right);
}
}