Maximum Value
rg
g
//{ Driver Code Starts
//Initial Template for C++
#include <bits/stdc++.h>
using namespace std;
/* A binary tree node has data, pointer to left child
and a pointer to right child */
struct Node {
int data;
struct Node* left;
struct Node* right;
};
// } Driver Code Ends
//User function Template for C++
/* Tree node structure used in the program
struct Node
{
int data;
struct Node* left;
struct Node* right;
}; */
class Solution {
public:
vector<int> maximumValue(Node* root) {
queue<Node *> q;
vector<int> ans;
if (!root)
return ans;
q.push(root);
while (!q.empty())
{
vector<int> v;
int size = q.size();
// ans.push_back(q.front()->data);
while (size--)
{
Node *t = q.front();
v.push_back(t->data);
q.pop();
if (t->left)
q.push(t->left);
if (t->right)
q.push(t->right);
}
int a = *max_element(v.begin(), v.end());
ans.push_back(a);
}
return ans;
}
};
//{ Driver Code Starts.
Node* newNode(int val) {
Node* temp = new Node;
temp->data = val;
temp->left = NULL;
temp->right = NULL;
return temp;
}
Node* buildTree(string str) {
// Corner Case
if (str.length() == 0 || str[0] == 'N') return NULL;
// Creating vector of strings from input
// string after spliting by space
vector<string> ip;
istringstream iss(str);
for (string str; iss >> str;) ip.push_back(str);
// Create the root of the tree
Node* root = newNode(stoi(ip[0]));
// Push the root to the queue
queue<Node*> queue;
queue.push(root);
// Starting from the second element
int i = 1;
while (!queue.empty() && i < ip.size()) {
// Get and remove the front of the queue
Node* currNode = queue.front();
queue.pop();
// Get the current node's value from the string
string currVal = ip[i];
// If the left child is not null
if (currVal != "N") {
// Create the left child for the current node
currNode->left = newNode(stoi(currVal));
// Push it to the queue
queue.push(currNode->left);
}
// For the right child
i++;
if (i >= ip.size()) break;
currVal = ip[i];
// If the right child is not null
if (currVal != "N") {
// Create the right child for the current node
currNode->right = newNode(stoi(currVal));
// Push it to the queue
queue.push(currNode->right);
}
i++;
}
return root;
}
/* Function to get Largest value at each level of Binary Tree */
vector<int> maximumValue(struct Node* tree);
int main() {
int t;
scanf("%d\n", &t);
while (t--) {
string s;
getline(cin, s);
Node* root = buildTree(s);
Solution ob;
vector<int> answer = ob.maximumValue(root);
for(auto i:answer)
cout<<i<<" ";
cout<<endl;
}
return 0;
}
// } Driver Code Ends