104. Maximum Depth of Binary Tree
发布时间:2020-12-14 04:47:15 所属栏目:大数据 来源:网络整理
导读: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,nul
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? return its depth = 3. ? ? 很简单的二叉树题目,直接看代码就ok了。 int maxDepth(struct TreeNode* root) { if(root==NULL) return 0; if(root->left==NULL&&root->right==NULL) return 1; else if(root->left!=NULL&&root->right==NULL) return maxDepth(root->left)+1; else if(root->left==NULL&&root->right!=NULL) return maxDepth(root->right)+1; else return _max(maxDepth(root->left)+1,maxDepth(root->right)+1); } int _max(int a,int b) { if(a>b) return a; else return b; } (编辑:李大同) 【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容! |