diff --git a/4 May  Construct Binary Tree from Inorder and Postorder b/4 May  Construct Binary Tree from Inorder and Postorder
new file mode 100644
index 00000000..ab2b76d9
--- /dev/null
+++ b/4 May  Construct Binary Tree from Inorder and Postorder	
@@ -0,0 +1,28 @@
+class Solution
+{
+    public:
+
+    Node *solve(int in[], int post[], int inStart, int inEnd, int posStart, int posEnd)
+{
+    if (posEnd < 0 || inStart > inEnd)
+        return NULL;
+    Node *root = new Node(post[posEnd]);
+    int i = inStart;
+    for (; i <= inEnd; i++)
+    {
+        if (root->data == in[i])
+        {
+            break;
+        }
+    }
+    int left = i - inStart;
+    int right = inEnd - i;
+    root->left = solve(in, post, inStart, i - 1, posStart, posStart + left - 1);
+    root->right = solve(in, post, i + 1, inEnd, posEnd - right, posEnd - 1);
+    return root;
+}
+Node *buildTree(int in[], int post[], int n)
+{
+    return solve(in, post, 0, n - 1, 0, n - 1);
+}
+};