LeetCode 104 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.

题目描述

对于给定的二叉树，返回其最大的深度

解题思路

深度优先搜索DFS，递归的方法

/* C++ *//** * Definition for a binary tree node. * struct TreeNode { *     int val; *     TreeNode *left; *     TreeNode *right; *     TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public:    int maxDepth(TreeNode* root) {        return (root == NULL)? 0: max(maxDepth(root->left),maxDepth(root->right))+1;    }};