Maximum Depth of Binary Tree

Author: parshva45

Maximum Depth of Binary Tree.js

@@ -0,0 +1,34 @@
+/*Given a binary tree, find its maximum depth.
+
+The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.
+
+For example:
+Given binary tree [3,9,20,null,null,15,7],
+
+    3
+   / \
+  9  20
+    /  \
+   15   7
+return its depth = 3.*/
+
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val) {
+ *     this.val = val;
+ *     this.left = this.right = null;
+ * }
+ */
+/**
+ * @param {TreeNode} root
+ * @return {number}
+ */
+var maxDepth = function(root) {
+    if(root == null)
+        return 0
+    return 1 + max(maxDepth(root.left),maxDepth(root.right))
+};
+
+var max = function(a,b){
+    return a>b?a:b
+};