LeetCode501.二叉搜索树中的众数

class Solution {
public:
    void clearVector(vector<int>& res)
    {
        while (!res.empty())
            res.pop_back();
    }
    void inOrderTraversal(TreeNode* root, vector<int>& Nodes)
    {
        if (root == nullptr)
            return;
        else
        {
            inOrderTraversal(root->left, Nodes);
            Nodes.push_back(root->val);
            inOrderTraversal(root->right, Nodes);
        }
    }
    vector<int> findMode(TreeNode* root) {
        int maxCount = 1;
        vector<int> res;
        vector<int> Nodes;
        unordered_map<int, int> map;
        inOrderTraversal(root, Nodes);
        //统计每个数的出现次数
        for (int i = 0; i < Nodes.size(); i++)
        {
            auto it = map.find(Nodes[i]);
            if (it == map.end())
            {   //还未出现过
               map.insert(pair<int, int>(Nodes[i], 1));
            }
            else
            {   //出现次数++
                it->second++;
            }
        }
        //统计众数
        for (const auto& pair : map)
        {
            if (pair.second > maxCount)
            {
                maxCount = pair.second;
                clearVector(res);
                res.push_back(pair.first);
            }
            else if (pair.second == maxCount)
            {
                res.push_back(pair.first);
            }
        }
        return res;
    }
};