Skip to content
Navigation Menu
Sign in
Products
Platform
GitHub
Repository hosting, code review, and collaboration
Copilot
AI coding agent for tasks, projects, and automated work
Build & Ship
Actions
CI/CD and automation
Code Quality
Quality analysis, fixes, and enforcement
Codespaces
Cloud development environments
Secure
Code Security
Vulnerability detection and remediation
Secret Protection
Secret scanning and leak prevention
All Features
Developers
Learn
Documentation
Training
Certifications
Build
Build with Copilot
Customize Copilot
Integrations
Explore
Trending repos
GitHub Sponsors
Developer articles
Changelog
Changelog
Your source for the latest features, improvements, and fixes across GitHub products, all in one place.
Businesses
By Stage
Enterprises
Team
Startups
Nonprofits
By Industry
Healthcare
Financial services
Manufacturing
Government
See all industries
Evaluate GitHub
Why GitHub
Customer Stories
Business insights
Trust Center
Add-ons
GitHub Advanced Security
Enterprise-grade code security
Copilot for business
Enterprise-grade AI features
Premium Support
Enterprise-grade 24/7 support
Resources
Learn & Connect
Documentation
Resource center
Blog
Events & webinars
Community Forum
Customer Stories
Integrations
Support
Customer support
Training
GitHub Status
Company
About
Partners
Changelog
GitHub Universe
GitHub Universe
The event for developers, by developers — talks, workshops, and what’s next for GitHub.
Pricing
Search
/
Sign in
Sign up
Appearance settings
You signed in with another tab or window.
Reload
to refresh your session.
You signed out in another tab or window.
Reload
to refresh your session.
You switched accounts on another tab or window.
Reload
to refresh your session.
Dismiss alert
{{ message }}
ecmadao
algorithms
Repository navigation
Code
Issues
1
(1)
Pull requests
2
(2)
Actions
Projects
Security and quality
Insights
More
items
Files
Expand file tree
master
Breadcrumbs
algorithms
/
leetcode
/
JavaScript
/
No173.binary-search-tree-iterator.js
Copy path
Blame
More file actions
Blame
More file actions
Latest commit
History
History
History
69 lines (64 loc) · 1.6 KB
master
Breadcrumbs
algorithms
/
leetcode
/
JavaScript
/
No173.binary-search-tree-iterator.js
Copy path
Top
File metadata and controls
Code
Blame
69 lines (64 loc) · 1.6 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
/**
* Difficulty:
* Medium
*
* Desc:
* 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.
*
* 创建 next() 和 hasNaxt() 方法,用以从小到大的获取 BST 中的全部元素。
* 要求两个方法都是 O(1) 的复杂度
* 实际上,这是一个中序遍历问题,参考 No94.binary-tree-inorder-traversal.js
* 需要注意的是,next() 和 hasNaxt() 要求 O(1) 的复杂度,且空间占用不能超过 O(h),h 是树的高度
*/
/**
* Definition for a binary tree node.
* function TreeNode(val) {
* this.val = val;
* this.left = this.right = null;
* }
*/
/**
* @param {TreeNode} root
*/
var BSTIterator = function(root) {
this.queue = []
if (root) {
let node = root
while (node) {
this.queue.push(node)
node = node.left
}
}
}
/**
* @return the next smallest number
* @return {number}
*/
BSTIterator.prototype.next = function() {
const node = this.queue.pop()
let tmp = node.right
while (tmp) {
this.queue.push(tmp)
tmp = tmp.left
}
return node.val
}
/**
* @return whether we have a next smallest number
* @return {boolean}
*/
BSTIterator.prototype.hasNext = function() {
return this.queue.length > 0
}
/**
* Your BSTIterator object will be instantiated and called as such:
* var obj = new BSTIterator(root)
* var param_1 = obj.next()
* var param_2 = obj.hasNext()
*/
You can’t perform that action at this time.