[LeetCode] Maximum Depth of Binary Tree

문제

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.

 

Approach

DFS를 활용한 inorder traversal로 depth를 측정하거나

BFS를 활용한 level order traversal로 depth를 측정하면 된다.

 

Code

DFS: https://github.com/chi3236/algorithm/blob/master/LeetCode_MaximumDepthOfBinaryTree_DFS.cpp

chi3236/algorithm

BFS: https://github.com/chi3236/algorithm/blob/master/LeetCode_MaximumDepthOfBinaryTree_BFS.cpp

chi3236/algorithm