Merge pull request #484 from ankank30/master

Tree views and Diagonal traversal

Author: probot-auto-merge[bot]

Tree/Tree Traversal/DiagonalTraversal.cpp

@@ -0,0 +1,77 @@
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+class Node {
+
+public:
+    int value;
+    Node* left;
+    Node* right;
+
+    Node (int val) {
+        this->value = val;
+        this->left = NULL;
+        this->right = NULL;
+    }
+};
+
+vector< vector< int > > diaTree;
+
+void diagonalTraversalUtil (Node* root, int index) {
+    if (root == NULL) {
+        return;
+    }
+
+    if (index < diaTree.size()) {
+        diaTree[index].push_back(root->value);
+    } else {
+        vector<int> temp = {root->value};
+
+        diaTree.push_back(temp);
+    }
+    diagonalTraversalUtil (root->left, index+1);
+    diagonalTraversalUtil (root->right, index);
+}
+
+void diagonalTraversal (Node* root) {
+
+    diagonalTraversalUtil (root, 0);
+
+    for (int i = 0; i < diaTree.size(); i++) {
+        cout << "Diagonal " << i+1 << ": ";
+        for (int j = 0; j < diaTree[i].size(); j++) {
+            cout << diaTree[i][j] << " ";
+        }
+        cout << endl;
+    }
+}
+
+int main () {
+    Node* root = new Node(1);
+    root->left = new Node(2);
+    root->right = new Node(3);
+    root->left->left = new Node(4);
+    root->left->right = new Node(5);
+    root->right->left = new Node(6);
+    root->right->left->left = new Node(7);
+
+
+    /*
+                1
+               / \
+              /   \
+             2     3
+            / \    |
+           /   \   |
+          4     5 /
+                 6
+                /
+               7
+    */
+
+    diagonalTraversal(root);
+
+    return 0;
+}

Tree/Tree View/BottomView.cpp

@@ -0,0 +1,81 @@
+#include <iostream>
+#include <deque>
+
+using namespace std;
+
+class Node {
+
+public:
+    int value;
+    Node* left;
+    Node* right;
+
+    Node (int val) {
+        this->value = val;
+        this->left = NULL;
+        this->right = NULL;
+    }
+};
+
+deque <int> dq;
+int low, high;
+
+void bottomViewUtil (Node* root, int horDist) {
+    if (root == NULL) {
+        return;
+    }
+
+    if (!dq.empty() && horDist > high) {
+        dq.push_back(root->value);
+        high++;
+    } else if (horDist < low) {
+        dq.push_front(root->value);
+        low--;
+    } else {
+        dq[horDist-low] = root->value;
+    }
+    bottomViewUtil (root->left, horDist-1);
+    bottomViewUtil (root->right, horDist+1);
+}
+
+void bottomView (Node* root) {
+    low = 0;
+    high = -1;
+
+    bottomViewUtil (root, 0);
+
+    deque <int> :: iterator i;
+
+    cout << "Bottom View: ";
+    for (i = dq.begin(); i != dq.end(); i++) {
+        cout << *i << " ";
+    }
+    cout << endl;
+}
+
+int main () {
+    Node* root = new Node(1);
+    root->left = new Node(2);
+    root->right = new Node(3);
+    root->left->left = new Node(4);
+    root->left->right = new Node(5);
+    root->right->left = new Node(6);
+    root->right->left->left = new Node(7);
+
+
+    /*
+                1
+               /.\
+              2 . 3
+             /.\. |
+            4 . 5 |
+              . ./
+              . 6
+              ./
+              7
+    */
+
+    bottomView(root);
+
+    return 0;
+}

Tree/Tree View/LeftView.cpp

@@ -0,0 +1,72 @@
+#include <iostream>
+
+using namespace std;
+
+class Node {
+
+public:
+    int value;
+    Node* left;
+    Node* right;
+
+    Node (int val) {
+        this->value = val;
+        this->left = NULL;
+        this->right = NULL;
+    }
+};
+
+int maxLevel;
+
+void leftViewUtil(Node* root, int level) {
+    // Check if new level reached is the highest
+    if (maxLevel < level) {
+        cout << root -> value << endl;
+        maxLevel = level;
+    }
+
+    // Left side of the tree is traversed first so that
+    // left nodes are checked first for the condition that
+    // whether they have reached new max level or not.
+    if (root -> left != NULL) {
+        leftViewUtil(root -> left, level+1);
+    }
+
+    if (root -> right != NULL) {
+        leftViewUtil(root -> right, level+1);
+    }
+}
+
+void leftView(Node *root) {
+   maxLevel = -1;
+
+   leftViewUtil(root, 0);
+}
+
+int main () {
+    Node* root = new Node(1);
+    root->left = new Node(2);
+    root->right = new Node(3);
+    root->left->left = new Node(4);
+    root->left->right = new Node(5);
+    root->right->left = new Node(6);
+    root->right->left->left = new Node(7);
+
+
+    /*
+      ->        1
+               / \
+              /   \
+             /     \
+      ->    2       3
+           / \     /
+      ->  4   5   6
+                 /
+      ->        7
+    */
+
+    cout << "Left view of the tree: \n";
+    leftView(root);
+
+    return 0;
+}

Tree/Tree View/TopView.cpp

@@ -0,0 +1,84 @@
+#include <iostream>
+#include <deque>
+
+using namespace std;
+
+class Node {
+
+public:
+    int value;
+    Node* left;
+    Node* right;
+
+    Node (int val) {
+        this->value = val;
+        this->left = NULL;
+        this->right = NULL;
+    }
+};
+
+deque <int> dq;
+int low, high;
+
+void topViewUtil (Node* root, int horDist) {
+    if (root == NULL) {
+        return;
+    }
+
+    if (!dq.empty() && horDist > high) {
+        dq.push_back(root->value);
+        high++;
+    } else if (horDist < low) {
+        dq.push_front(root->value);
+        low--;
+    }
+    topViewUtil (root->left, horDist-1);
+    topViewUtil (root->right, horDist+1);
+}
+
+void topView (Node* root) {
+    low = 0;
+    high = 0;
+
+    dq.push_back(root->value);
+    topViewUtil (root, 0);
+
+    deque <int> :: iterator i;
+
+    cout << "Bottom View: ";
+    for (i = dq.begin(); i != dq.end(); i++) {
+        cout << *i << " ";
+    }
+    cout << endl;
+}
+
+int main () {
+    Node* root = new Node(1);
+    root->left = new Node(2);
+    root->right = new Node(3);
+    root->left->left = new Node(4);
+    root->left->right = new Node(5);
+    root->right->left = new Node(6);
+    root->right->left->left = new Node(7);
+
+
+    /*
+                1
+               /.\
+              / . \
+             2  .  3
+            /.\ .  |
+           / . \.  |
+          4  .  5  |
+             .  . /
+             .  ./
+             .  6
+             . /
+             ./
+             7
+    */
+
+    topView(root);
+
+    return 0;
+}