Leetcode——501. Find Mode in Binary Search Tree

#

https://leetcode.com/problems/find-mode-in-binary-search-tree/?tab=Solutions
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).

#

My Solution!!!
Use unordered_map,BFS

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<int> findMode(TreeNode* root) {
        unordered_map<int,int>map;
        vector<int>res;
        int MaxcountMode=GetMaxcountMode(root,map);
        for(unordered_map<int,int>::iterator it=map.begin();it!=map.end();it++)
        {
            if(it->second==MaxcountMode)
                res.push_back(it->first);
        }
        return res;
    }

private:
    int GetMaxcountMode(TreeNode *root, unordered_map<int,int>&map)
    {
        if(root==NULL)
            return 0;
        if(map.find(root->val)!=map.end())
            map[root->val]++;
        else
            map[root->val]=1;//initialize 1
        int lf=GetMaxcountMode(root->left,map);
        int rf=GetMaxcountMode(root->right,map);
        return max(map[root->val],max(rf,lf));
    }

};