Maximum Width of Tree

Author: ankit-tyagi

Tree/Maximum Width of Tree.cpp

@@ -0,0 +1,113 @@
+
+#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;
+    
+    Node(int x){
+        data = x;
+        left = right = NULL;
+    }
+};
+/* Function to get the maximum width of a binary tree*/
+int getMaxWidth(Node* root);
+/* Driver program to test size function*/
+int main()
+{
+  int t;
+  struct Node *child;
+  scanf("%d", &t);
+  while (t--)
+  {
+     map<int, Node*> m;
+     int n;
+     scanf("%d",&n);
+     struct Node *root = NULL;
+     while (n--)
+     {
+        Node *parent;
+        char lr;
+        int n1, n2;
+        scanf("%d %d %c", &n1, &n2, &lr);
+        if (m.find(n1) == m.end())
+        {
+           parent = new Node(n1);
+           m[n1] = parent;
+           if (root == NULL)
+             root = parent;
+        }
+        else
+           parent = m[n1];
+        child = new Node(n2);
+        if (lr == 'L')
+          parent->left = child;
+        else
+          parent->right = child;
+        m[n2]  = child;
+     }
+     cout << getMaxWidth(root) << endl;
+  }
+  return 0;
+}
+
+
+/*This is a function problem.You only need to complete the function given below*/
+/*  Structure of a Binary Tree 
+struct Node
+{
+    int data;
+    struct Node* left;
+    struct Node* right;
+    
+    Node(int x){
+        data = x;
+        left = right = NULL;
+    }
+};
+ */
+/* Function to get the maximum width of a binary tree*/
+int getMaxWidth(Node* root)
+{
+    if(root == NULL)
+        return 0;
+    
+    queue<Node*> q;
+    q.push(root);
+    int size = q.size();
+    int result = size;
+    while(!q.empty())
+    {
+        size = q.size();
+        while(size>0)
+        {
+            Node* temp = q.front();
+            q.pop();
+            if(temp->left)
+                q.push(temp->left);
+            if(temp->right)
+                q.push(temp->right);
+            size--;
+
+        }
+        if(result< q.size())
+            result = q.size();
+    }
+    return result;
+   // Your code here
+}
+
+/*Input:
+2
+2
+1 2 R 1 3 L
+4
+10 20 L 10 30 R 20 40 L 20 60 R
+
+Output:
+2
+2 */