// { Driver Code Starts
      #include <bits/stdc++.h>
      using namespace std;
      // Tree Node
      struct Node
      {
          int data;
          Node* left;
          Node* right;
      };
      // Utility function to create a new Tree Node
      Node* newNode(int val)
      {
          Node* temp = new Node;
          temp->data = val;
          temp->left = NULL;
          temp->right = NULL;
          return temp;
      }
      int maxDiff(Node *root);
      // Function to Build Tree
      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;
      }
      int main() {
          int t;
          string tc;
          getline(cin, tc);
          t=stoi(tc);
          while(t--)
          {
              string s ;
              getline(cin, s);
              Node* root = buildTree(s);
              cout<<maxDiff(root)<<endl;
          }
          return 0;
      }
      // } Driver Code Ends
      /* A binary tree node
      struct Node
      {
          int data;
          struct Node* left;
          struct Node* right;
          Node(int x){
              data = x;
              left = right = NULL;
          }
      };
       */
       */
      /* Your are required to 
      complete this method*/
      int findMaxDiff(Node* root,int *maxDiff){
          if(!root)
              return INT_MAX;
          int left=findMaxDiff(root->left,maxDiff);
          int right=findMaxDiff(root->right,maxDiff);
          if(!root->left and !root->right)
              return root->data;
          if(root->data-left>*maxDiff)
              *maxDiff=root->data-left;
          if(root->data-right>*maxDiff)
              *maxDiff=root->data-right;
          return min(root->data,min(left,right));
      }
      int maxDiff(Node* root)
      {
          int maxDif = INT_MIN;
          findMaxDiff(root,&maxDif);
          return maxDif;
      }
      
      Cpp language logo

      MAX_DIFF_NODE_ANCES

      0

      0

      avatar
      virendrakgarg

      0 Comments

        Add Comment

        Log in to add a comment

        Codiga - All rights reserved 2022.