리트코드/easy
[리트코드] 104. Maximum Depth of Binary Tree - js
bbeyak
2023. 7. 11. 10:17
반응형
1. 문제
https://leetcode.com/problems/maximum-depth-of-binary-tree/description/
Maximum Depth of Binary Tree - LeetCode
Can you solve this real interview question? Maximum Depth of Binary Tree - Given the root of a binary tree, return its maximum depth. A binary tree's maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf
leetcode.com
2. 코드
/**
* 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;
return 1 + Math.max(maxDepth(root.left), maxDepth(root.right));
};
반응형