diff --git a/README.md b/README.md
index 4ab31c7..92e9cfb 100644
--- a/README.md
+++ b/README.md
@@ -9,6 +9,7 @@ LeetCode
 | # | Title | Solution | Difficulty |
 |---| ----- | -------- | ---------- |
 |988|[Smallest String Starting From Leaf](https://leetcode.com/problems/smallest-string-starting-from-leaf/) | [C++](./algorithms/cpp/smallestStringStartingFromLeaf/SmallestStringStartingFromLeaf.cpp)|Medium|
+|987|[Vertical Order Traversal of a Binary Tree](https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree/) | [C++](./algorithms/cpp/verticalOrderTraversalOfABinaryTree/VerticalOrderTraversalOfABinaryTree.cpp)|Medium|
 |985|[Sum of Even Numbers After Queries](https://leetcode.com/problems/sum-of-even-numbers-after-queries/) | [C++](./algorithms/cpp/sumOfEvenNumbersAfterQueries/SumOfEvenNumbersAfterQueries.cpp)|Easy|
 |984|[String Without AAA or BBB](https://leetcode.com/problems/string-without-aaa-or-bbb/) | [C++](./algorithms/cpp/stringWithoutAAAOrBBB/StringWithoutAAAOrBBB.cpp)|Easy|
 |983|[Minimum Cost For Tickets](https://leetcode.com/problems/minimum-cost-for-tickets/) | [C++](./algorithms/cpp/minimumCostForTickets/MinimumCostForTickets.cpp)|Medium|
diff --git a/algorithms/cpp/verticalOrderTraversalOfABinaryTree/VerticalOrderTraversalOfABinaryTree.cpp b/algorithms/cpp/verticalOrderTraversalOfABinaryTree/VerticalOrderTraversalOfABinaryTree.cpp
new file mode 100644
index 0000000..3eea51c
--- /dev/null
+++ b/algorithms/cpp/verticalOrderTraversalOfABinaryTree/VerticalOrderTraversalOfABinaryTree.cpp
@@ -0,0 +1,133 @@
+// Source : https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree/
+// Author : Hao Chen
+// Date   : 2019-02-05
+
+/***************************************************************************************************** 
+ *
+ * Given a binary tree, return the vertical order traversal of its nodes values.
+ * 
+ * For each node at position (X, Y), its left and right children respectively will be at positions 
+ * (X-1, Y-1) and (X+1, Y-1).
+ * 
+ * Running a vertical line from X = -infinity to X = +infinity, whenever the vertical line touches 
+ * some nodes, we report the values of the nodes in order from top to bottom (decreasing Y 
+ * coordinates).
+ * 
+ * If two nodes have the same position, then the value of the node that is reported first is the value 
+ * that is smaller.
+ * 
+ * Return an list of non-empty reports in order of X coordinate.  Every report will have a list of 
+ * values of nodes.
+ * 
+ * Example 1:
+ *    
+ *    
+ *          +--+
+ *     +----+3 +----+
+ *     |    +--+    |
+ *     |            |
+ *    +--+        +--+
+ *    |9 |    +---+20+---+
+ *    +--+    |   +--+   |
+ *            |          |
+ *          +--+       +--+
+ *          |15|       |7 |
+ *          +--+       +--+
+ *    
+ * 
+ * Input: [3,9,20,null,null,15,7]
+ * Output: [[9],[3,15],[20],[7]]
+ * Explanation: 
+ * Without loss of generality, we can assume the root node is at position (0, 0):
+ * Then, the node with value 9 occurs at position (-1, -1);
+ * The nodes with values 3 and 15 occur at positions (0, 0) and (0, -2);
+ * The node with value 20 occurs at position (1, -1);
+ * The node with value 7 occurs at position (2, -2).
+ * 
+ * Example 2:
+ * 
+ *    
+ *              +-+
+ *              |1|
+ *         +-----------+
+ *         |           |
+ *        +++         +++
+ *        |2|         |3|
+ *     +--------+  +--------+
+ *     |        |  |        |
+ *    +++      ++--++      +++
+ *    |4|      |5||6|      |7|
+ *    +-+      +----+      +-+
+ *    
+ *    
+ * Input: [1,2,3,4,5,6,7]
+ * Output: [[4],[2],[1,5,6],[3],[7]]
+ * Explanation: 
+ * The node with value 5 and the node with value 6 have the same position according to the given 
+ * scheme.
+ * However, in the report "[1,5,6]", the node value of 5 comes first since 5 is smaller than 6.
+ * 
+ * Note:
+ * 
+ * 	The tree will have between 1 and 1000 nodes.
+ * 	Each node's value will be between 0 and 1000.
+ * 
+ ******************************************************************************************************/
+
+/**
+ * Definition for a binary tree node.
+ * struct TreeNode {
+ *     int val;
+ *     TreeNode *left;
+ *     TreeNode *right;
+ *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
+ * };
+ */
+class Item {
+public:
+    Item(int _x, int _y, int _val):x(_x), y(_y),val(_val) {}
+    int x, y;
+    int val;
+};
+
+class ItemCmp {
+public:
+    bool operator () (const Item &lhs, const Item &rhs) const {
+        return lhs.y != rhs.y ? lhs.y > rhs.y : lhs.val < rhs.val;
+    }
+};
+
+int getValue(const Item& i) {
+    return i.val;
+}
+
+class Solution {
+public:
+    vector<vector<int>> verticalTraversal(TreeNode* root) {
+        set<int> rows;
+        unordered_map<int, set<Item, ItemCmp>> m;
+
+        verticalTraversalHelper(root, 0, 0, rows, m);
+
+        vector<vector<int>> result;
+        for(auto r : rows) {
+            vector<int> v;
+            transform(m[r].begin(), m[r].end(), back_inserter(v), getValue);
+            result.push_back(v);
+        }
+        return result;
+    }
+    void verticalTraversalHelper(TreeNode* root, int x, int y,
+                                 set<int>& rows,
+                                 unordered_map<int, set<Item, ItemCmp>>& m) {
+
+        if ( !root ) return;
+
+        rows.insert(x);
+        m[x].insert(Item(x, y, root->val));
+        verticalTraversalHelper(root->left, x-1, y-1, rows, m); //left
+        verticalTraversalHelper(root->right, x+1, y-1, rows, m); //right
+
+
+    }
+};