LeetCode501.二叉搜索树中的众数

题目，本题未做出，还有很多要学习

class Solution {
public:
    vector<int>ans;
    int base,count,maxCount;
    void update(int x){
        if(base == x){
            count++;
        }else{
            base = x;
            count = 1;
        }
        if(count == maxCount) ans.push_back(base);
        if(count > maxCount)  {maxCount = count;ans = vector<int>{base};}
    }

    void dfs(TreeNode* root){
        if(root == NULL) return;
        dfs(root->left);
        update(root->val);
        dfs(root->right);
    }

    vector<int> findMode(TreeNode* root) {
        dfs(root);
        return ans;
    }
};