Wow you have been viewing my site since 20 seconds!
+
Sep 21, 2024
/**
* Definition for a binary tree node.
* function TreeNode(val, left, right) {
* this.val = (val===undefined ? 0 : val)
* this.left = (left===undefined ? null : left)
* this.right = (right===undefined ? null : right)
* }
*/
/**
* @param {TreeNode} root
* @return {number}
*/
var maxDepth = function(root) {
if(root == null) return 0;
if(root != null && root.left == null && root.right == null) return 1;
return 1 + Math.max(maxDepth(root.left), maxDepth(root.right))
};
Check my latest Blog Post