501. Find Mode in Binary Search Tree

题目描述：

Given a binary search tree (BST) with duplicates, find all the mode(s) (the most frequently occurred element) in the given BST.

Assume a BST is defined as follows:

• The left subtree of a node contains only nodes with keys less than or equal to the node's key.
• The right subtree of a node contains only nodes with keys greater than or equal to the node's key.
• Both the left and right subtrees must also be binary search trees.

 

For example:
Given BST [1,null,2,2],

   1
    \
     2
    /
   2

 

return [2].

Note: If a tree has more than one mode, you can return them in any order.

Follow up: Could you do that without using any extra space? (Assume that the implicit stack space incurred due to recursion does not count).

思路：深度遍历整棵树，并把节点的值记录在一个map中，用于记录其出现的次数。

程序：

class Solution {
public:
    vector<int> findMode(TreeNode* root) {
        dfs(root);
        map<int,int>::iterator it = mp.begin();
        int max = -1;
        vector<int> v;
        while(it != mp.end()){
            if(it->second > max){
                v.clear();
                v.push_back(it->first);
                max = it->second;
            }
            else if(it->second == max){
                v.push_back(it->first);
            }
            it++;
        }
        return v;
    }
private:
    map<int, int> mp;
    void dfs(TreeNode* root){
        if(root){
            mp[root->val] += 1;
            dfs(root->left);
            dfs(root->right);
        }
    }    
};