diff --git a/Leetcode Challenge/June/Construct Binary Tree from Preorder and Inorder Traversal.cpp b/Leetcode Challenge/June/Construct Binary Tree from Preorder and Inorder Traversal.cpp
index d9ba6d1..ad8aa8d 100644
--- a/Leetcode Challenge/June/Construct Binary Tree from Preorder and Inorder Traversal.cpp	
+++ b/Leetcode Challenge/June/Construct Binary Tree from Preorder and Inorder Traversal.cpp	
@@ -41,7 +41,7 @@ class Solution {
         int rPrE = preorderEnd;
         
         root->left = buildTree_helper(preorder, inorder, lPrS, lPrE, lInS, lInE);
-        root->right = buildTree_helper(preorder, inorder, rPrS, rPrE, rInS, rInE)q;
+        root->right = buildTree_helper(preorder, inorder, rPrS, rPrE, rInS, rInE);
         
         return root;