二叉树的深度用深度优先搜索可以很快的写出来
#include<iostream>
#include<queue>
#include<vector>
using namespace std;
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 maxDepth(TreeNode* root) {
if (root == nullptr) return 0;
return max(maxDepth(root->left), maxDepth(root->right)) + 1;
}
};
int main() {
Solution test;
TreeNode* c = new TreeNode(3);
TreeNode* b = new TreeNode(2, c, nullptr);
TreeNode* a = new TreeNode(1, nullptr, b);
cout << test.maxDepth(a);
}