思路:用后序遍历,左右中,高度直接在此层数加1即可。
题解c++:
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
int getDepth(TreeNode* node)
{
if(node==NULL) return 0;
int left=getDepth(node->left);
int right=getDepth(node->right);
int height=1+max(left,right);
return height;
}
int maxDepth(TreeNode* root) {
int height=getDepth(root);
return height;
}
};