class BSTIterator {
public:
vector<int>res;
int i=0;
void increment()
{
i=i+1;
}
BSTIterator(TreeNode* root) {
res=inorderTraversal(root);
}
vector<int> inorderTraversal(TreeNode* root) {
if(root==NULL)
{
return res;
}
if(root->left!=NULL)
{
inorderTraversal(root->left);
}
res.push_back(root->val);
if(root->right!=NULL)
{
inorderTraversal(root->right);
}
return res;
}
int next() {
int temp= res[i];
increment();
return temp;
}
bool hasNext() {
return i<res.size();
}
};
Processed:
0.013, SQL:
9
