solved 2 questions from leetcode

LeetCode/pathSum.cpp

@@ -0,0 +1,24 @@
+// https://leetcode.com/problems/path-sum/
+#include<bits/stdc++.h>
+struct TreeNode {
+    int val;
+    TreeNode *left;
+    TreeNode *right;
+    TreeNode() : val(0), left(nullptr), right(nullptr) {}
+    TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
+    TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
+};
+
+using namespace std;
+
+bool hasPathSum(TreeNode* root, int targetSum) {
+    if(root==NULL)return false;
+    if(root->val==targetSum && root->left==NULL && root->right==NULL)return true;
+    return hasPathSum(root->left, targetSum-root->val) || hasPathSum(root->right, targetSum-root->val);
+
+}
+int main()
+{
+
+    return 0;
+}

LeetCode/symmetricTree.cpp

@@ -0,0 +1,18 @@
+// https://leetcode.com/problems/symmetric-tree/
+#include<bits/stdc++.h>
+#include "TreeNode2.h"
+using namespace std;
+bool helper(TreeNode *root1, TreeNode *root2){
+    if(root1==NULL || root2==NULL)return root1==root2;
+    if(root1->val!=root2->val)return false;
+    else return helper(root1->left, root2->right) && helper(root1->right, root2->left);
+}
+bool isSymmetric(TreeNode* root) {
+    if(root==NULL)return true;
+    return helper(root->left, root->right);
+}
+int main()
+{
+
+    return 0;
+}