Vertical Width of a Binary Tree

Author: ankit-tyagi

Tree/Vertical Width of a Binary Tree.cpp

@@ -0,0 +1,100 @@
+
+//Initial Template for C++
+#include <bits/stdc++.h>
+using namespace std;
+struct Node
+{
+    int data;
+    struct Node* left;
+    struct Node* right;
+    
+    Node(int x){
+        data = x;
+        left = right = NULL;
+    }
+};
+// your task is to complete this functionh
+// function should return the width of the tree
+int verticalWidth(Node* root);
+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<<verticalWidth(root)<<endl;
+  }
+  return 0;
+}
+
+
+//Position this line where user code will be pasted.
+
+/*This is a function problem.You only need to complete the function given below*/
+//User function Template for C++
+/*Structure of node of binary tree is as
+struct Node
+{
+    int data;
+    struct Node* left;
+    struct Node* right;
+    
+    Node(int x){
+        data = x;
+        left = right = NULL;
+    }
+};
+*/
+// your task is to complete this functionh
+// function should return the width of the tree
+
+void verwid(Node* root, int *mindis, int *maxdis, int current_distance)
+{
+    if(root == NULL)
+        return;
+    if(current_distance < *mindis)
+        *mindis -=1;
+    if(current_distance > *maxdis)
+        *maxdis +=1;
+    if(root->left)
+        verwid(root->left,mindis,maxdis,current_distance-1);
+    if(root->right)
+        verwid(root->right,mindis,maxdis, current_distance+1);
+}
+
+int verticalWidth(Node* root)
+{
+    if(root == NULL)
+        return 0;
+    int mindis=0,maxdis=0;
+    verwid(root,&mindis,&maxdis,0);
+    return (maxdis - mindis +1);
+    // Code here
+}