104.二叉树的最大深度|111.二叉树的最小深度|222.完全二叉树的节点个数

• 104/111.二叉树的最大/小深度
  • 前/后序遍历,层序遍历均可
• 222.完全二叉树的节点个数
  • 常规思路

/**
 * 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:
    void preOrder(TreeNode* p, int &count) {
        if (p == nullptr)   return;
        count++;
        preOrder(p -> left, count);
        preOrder(p -> right, count);
    }
    int countNodes(TreeNode* root) {
        int count = 0;
        preOrder(root, count);
        return count;
    }
};