Adjusted Spacing

Author: Ykhan799

javascript/1457-pseudo-palindromic-paths-in-a-binary-tree.js

@@ -22,32 +22,32 @@ var pseudoPalindromicPaths  = function(root) {
 
     const removeNum = (num, hashSet) => {
         hashSet[num] = hashSet[num] - 1;
-        if(hashSet[num] === 0) delete hashSet[num];
+        if (hashSet[num] === 0) delete hashSet[num];
     }
 
     const isPalindrome = (hashSet) => {
 
         let oddOccurances = 0;
 
-        for(const key in hashSet) {
-            if(hashSet[key] % 2) oddOccurances++;
+        for (const key in hashSet) {
+            if (hashSet[key] % 2) oddOccurances++;
         }
 
         return oddOccurances < 2;
     }
 
     const dfs = (node, hashSet) => {
-        if(!node.left && !node.right && isPalindrome(hashSet)) return 1;
-        if(!node.left && !node.right) return 0;
+        if (!node.left && !node.right && isPalindrome(hashSet)) return 1;
+        if (!node.left && !node.right) return 0;
 
         let total = 0;
-        if(node.left) {
+        if (node.left) {
             addNum(node.left.val, hashSet);
             total += dfs(node.left, hashSet);
             removeNum(node.left.val, hashSet);
         } 
 
-        if(node.right) {
+        if (node.right) {
             addNum(node.right.val, hashSet);
             total += dfs(node.right, hashSet);
             removeNum(node.right.val, hashSet);
@@ -56,6 +56,6 @@ var pseudoPalindromicPaths  = function(root) {
         return total;
     }   
 
-    return dfs(root, {[root.val]: 1} );
+    return dfs(root, {[root.val]: 1} \);
 
 };