首页 > 代码库 > Binary Search Tree Iterator
Binary Search Tree Iterator
Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST.
Calling next()
will return the next smallest number in the BST.
Note: next()
and hasNext()
should run in average O(1) time and uses O(h) memory, where h is the height of the tree.
Credits:
Special thanks to @ts for adding this problem and creating all test cases.
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ class BSTIterator { private: TreeNode *it; TreeNode *last; void toList(TreeNode *root){ if(!root) return; //save TreeNode *cur=root; if(cur->left) toList(cur->left); cur->left=last; if(last) last->right=cur; last=cur; if(cur->right) toList(cur->right); } public: BSTIterator(TreeNode *root) { last=NULL; toList(root); it=last; while(it&&it->left){ it=it->left; } } /** @return whether we have a next smallest number */ bool hasNext() { return (it!=NULL); } /** @return the next smallest number */ int next() { int val= it->val; it=it->right; return val; } }; /** * Your BSTIterator will be called like this: * BSTIterator i = BSTIterator(root); * while (i.hasNext()) cout << i.next(); */
结果悲催了……
Submission Result: Runtime ErrorMore Details
Last executed input: | {2,1} |
可能是因为我改变了BST树的结构……
从网上搜索了一下,发现都是使用stack和中序遍历的……好吧,跟风
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ class BSTIterator { private: stack<TreeNode*> s; void toStack(TreeNode *root){ if(root){ TreeNode *p=root; while(p){ s.push(p); p=p->left; } } } public: BSTIterator(TreeNode *root) { toStack(root); } /** @return whether we have a next smallest number */ bool hasNext() { return !s.empty(); } /** @return the next smallest number */ int next() { TreeNode* n= s.top(); s.pop(); toStack(n->right); return n->val; } }; /** * Your BSTIterator will be called like this: * BSTIterator i = BSTIterator(root); * while (i.hasNext()) cout << i.next(); */
Binary Search Tree Iterator
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。