aboutsummaryrefslogtreecommitdiff
path: root/max_depth_binary_tree.cpp
blob: e5ecc10a86c675e09071a97ea917f83def2f6183 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
// 104. Maximum Depth of Binary Tree
#include "leetcode.h"

/*
 * given the 'root' of a binary tree, return its maximum depth. a binary tree's
 * max depth is the number of nodes along the longest path from the root node
 * down to the farthest leaf node.
 */

class Solution {
public:
  int maxDepth(TreeNode *root) {
    if (!root)
      return 0;
    int max_left = maxDepth(root->left);
    int max_rght = maxDepth(root->right);
    return max(max_left, max_rght) + 1;
  }
};