刷题笔记day16-二叉树的深度
104.二叉树的最大深度
/*** 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 == nullptr)return 0;int d1 = 1 + getDepth(node->left);int d2 = 1 + getDepth(node->right);return d1 > d2 ? d1: d2;}int maxDepth(TreeNode* root) {return getDepth(root);}
};