首页 > 代码库 > [LeetCode] Maximum Depth of Binary Tree dfs,深度搜索
[LeetCode] Maximum Depth of Binary Tree dfs,深度搜索
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.
Hide Tags
Tree Depth-first Search 简单的深度搜索
#include <iostream>using namespace std;/** * Definition for binary tree */struct TreeNode { int val; TreeNode *left; TreeNode *right; TreeNode(int x) : val(x), left(NULL), right(NULL) {}};class Solution {public: int maxRet; int maxDepth(TreeNode *root) { maxRet=0; int curDep=1; help_f(root,curDep); return maxRet; } void help_f(TreeNode * root,int &curDep) { if(root==NULL) return ; curDep++; help_f(root->left,curDep); help_f(root->right,curDep); curDep--; if(root->left==NULL&&root->right==NULL){ if(maxRet<curDep) maxRet=curDep; } }};int main(){ return 0;}
[LeetCode] Maximum Depth of Binary Tree dfs,深度搜索
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。