思路:中序遍历后对遍历得到的数组进行计数/排序。
/**
* 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:
void midvisit(TreeNode* root,vector<int>& ve)
{
if(root!=NULL)
{
midvisit(root->left,ve);
ve.push_back(root->val);
midvisit(root->right,ve);
}
}
vector<int> findMode(TreeNode* root)
{
int max=1;
int cur=1;
vector<int> ve;
vector<int> ret;
if(root==NULL)
return ret;
midvisit(root->left,ve);
ve.push_back(root->val);
midvisit(root->right,ve);
ret.push_back(ve[0]);
for(int i=1;i<ve.size();i++)
{
if(ve[i]==ve[i-1])
{
cur++;
}
else
{
cur=1;
}
if(cur==max)
{
ret.push_back(ve[i]);
}
if(cur>max)
{
ret.clear();
max=cur;
ret.push_back(ve[i]);
}
}
return ret;
}
};