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).
参考资料:here。
/**
* 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 {
private:
int current_value = 0, count = 0, max_count = 0;
vector<int> ans;
void inorder(TreeNode *root){
if(root == NULL) return;
inorder(root->left);
count++;
if(current_value != root->val){
current_value = root->val;
count = 1;
}
if(count>max_count){
max_count = count;
ans.clear();
ans.push_back(current_value);
}
else if(count == max_count) ans.push_back(current_value);
inorder(root->right);
}
public:
vector<int> findMode(TreeNode* root) {
inorder(root);
return ans;
}
};