代码随想录打卡16天

class Solution {
public:int maxDepth(TreeNode* root) {queue que;int count=0;if(root!=nullptr) que.push(root);while(!que.empty()){int s=que.size();count++;for(int i=0;ileft) que.push(node->left);if(node->right) que.push(node->right);}} return count;}
};

class Solution {
public:int minDepth(TreeNode* root) {queue que;int count=0;if(root!=nullptr) que.push(root);while(!que.empty()){int s=que.size();count++;for(int i=0;ileft==nullptr&&node->right==nullptr) return count;if(node->left) que.push(node->left);if(node->right) que.push(node->right);}} return count;}
};

class Solution {
public:int maxDepth(Node* root) {queue a;if(root==nullptr) return 0;int depth=0;a.push(root);while(!a.empty()){int size=a.size();depth++;for(int i=0;ichildren.size();for(int j=0;jchildren[j]);}}}return depth;}
};

class Solution {
public:void countn(TreeNode* &root,int deep,int&count,vector>&res){if(root==nullptr) return;if(deep==res.size()) res.push_back(vector());res[0].push_back(root->val);count++;countn(root->left,deep+1,count,res);countn(root->right,deep+1,count,res);}int countNodes(TreeNode* root) {int count=0;vector> res;countn(root,0,count,res);return count;}
};