티스토리 뷰
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.
Note: A leaf is a node with no children.
Example:
Given binary tree [3,9,20,null,null,15,7],
3
/ \
9 20
/ \
15 7
return its depth = 3.
var maxDepth = function(root) {
let depth = 0;
const dfs = (root, len) => {
if(!root) {
depth = Math.max(len - 1, depth);
return;
}
dfs(root.left, len + 1);
dfs(root.right, len + 1);
}
dfs(root, 1);
return depth;
};
'알고리즘' 카테고리의 다른 글
[프로그래머스, 레벨3, 해시] 베스트앨범 (0) | 2020.06.28 |
---|---|
[트리] 1302. Deepest Leaves Sum (가장 깊은 잎들의 합을 구하기) (0) | 2020.06.21 |
[트리] 왼쪽 잎들의 합을 구하기(404. Sum of Left Leaves) (0) | 2020.06.21 |
Longest Palindromic Substring (0) | 2020.06.05 |
longest-substring-without-repeating-characters (0) | 2020.05.30 |
댓글
최근에 올라온 글
최근에 달린 댓글
- Total
- Today
- Yesterday
링크
TAG
- javascript
- state
- reflow
- computed
- Action
- Polyfill
- reducer
- storybook
- server side rendering
- return type
- reactdom
- promise
- atomic design
- await
- Babel
- rendering scope
- react
- useRef
- props
- es6
- useEffect
- async
- design system
- type alias
- hydrate
- react hooks
- mobx
- Next.js
- typescript
- webpack
일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | 2 | 3 | 4 | |||
5 | 6 | 7 | 8 | 9 | 10 | 11 |
12 | 13 | 14 | 15 | 16 | 17 | 18 |
19 | 20 | 21 | 22 | 23 | 24 | 25 |
26 | 27 | 28 | 29 | 30 | 31 |
글 보관함