给定一个有相同值的二叉搜索树(BST),找出 BST 中的所有众数(出现频率最高的元素)。
假定 BST 有如下定义:
结点左子树中所含结点的值小于等于当前结点的值
结点右子树中所含结点的值大于等于当前结点的值
左子树和右子树都是二叉搜索树
例如:
给定 BST [1,null,2,2],
1
\
2
/
2
返回[2].
提示:如果众数超过1个,不需考虑输出顺序
进阶:你可以不使用额外的空间吗?(假设由递归产生的隐式调用栈的开销不被计算在内)
tips:中序遍历,用类的公共变量记录众数。时间复杂度O(k), 空间复杂度O(1)
class Solution {
private:
int curr_num;
int curr_times;
int max_times_num;
int max_times;
int is_start;
public:
void inOrderVisit(TreeNode* root, vector<int> & res) {
if(root == NULL) {
return ;
}
inOrderVisit(root->left, res);
if(is_start == false) {
curr_num = root->val;
max_times_num = root->val;
curr_times = 1;
max_times = 1;
is_start = true;
} else {
if(root->val == curr_num) {
curr_times ++;
} else {
if(curr_times > max_times) {
max_times = curr_times;
max_times_num = curr_num;
res = {max_times_num};
} else if(curr_times == max_times) {
res.push_back(max_times_num);
}
curr_times = 1;
curr_num = root->val;
}
}
inOrderVisit(root->right, res);
}
vector<int> findMode(TreeNode* root) {
vector<int> res ;
if(root == NULL) {
return res;
}
is_start = false;
inOrderVisit(root, res);
if(curr_times > max_times) {
max_times = curr_times;
max_times_num = curr_num;
res = {max_times_num};
} else if(curr_times == max_times) {
res.push_back(max_times_num);
}
return res;
}
};