【LeetCode】 173. Binary Search Tree Iterator
来源:互联网 发布:龙bt发布永久域名 编辑:程序博客网 时间:2024/06/05 21:55
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.
/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class BSTIterator { private Stack<TreeNode> stack = new Stack<TreeNode>(); public BSTIterator(TreeNode root) { while (root != null) { stack.push(root); root = root.left; } } /** @return whether we have a next smallest number */ public boolean hasNext() { return !stack.isEmpty(); } /** @return the next smallest number */ public int next() { TreeNode temp = stack.pop(); TreeNode right = temp.right; while (right != null) { stack.push(right); right = right.left; } return temp.val; }}/** * Your BSTIterator will be called like this: * BSTIterator i = new BSTIterator(root); * while (i.hasNext()) v[f()] = i.next(); */
0 0
- [LeetCode]173.Binary Search Tree Iterator
- [leetcode] 173.Binary Search Tree Iterator
- LeetCode 173. Binary Search Tree Iterator
- Leetcode 173. Binary Search Tree Iterator
- 173. Binary Search Tree Iterator LeetCode
- [LeetCode]173. Binary Search Tree Iterator
- [LeetCode]173. Binary Search Tree Iterator
- leetcode 173. Binary Search Tree Iterator
- LeetCode *** 173. Binary Search Tree Iterator
- LeetCode 173. Binary Search Tree Iterator
- [leetcode] 173. Binary Search Tree Iterator
- <LeetCode OJ> 173. Binary Search Tree Iterator
- [LeetCode]problem 173. Binary Search Tree Iterator
- LeetCode - 173. Binary Search Tree Iterator
- [leetcode] 173. Binary Search Tree Iterator
- [LeetCode] 173. Binary Search Tree Iterator
- LeetCode 173. Binary Search Tree Iterator
- LeetCode 173. Binary Search Tree Iterator
- gcc编译选项:c++11 多线程编译
- js--继承
- EsLint规范
- 64bitpc vs环境下数据类型所占字节长度
- hdu 1799 排列组合求C(n,m)+预处理
- 【LeetCode】 173. Binary Search Tree Iterator
- [51nod1233] Grid Lines
- 2510: 弱题
- python 二进制字符串和整数之间的装换
- 38、ActiveMQ JMSDEMO1 一对一点对点发布消息
- 使用gdb调试内嵌汇编的代码
- opencv视频转图片并保存到文件夹下
- 最简实例说明wait、notify、notifyAll的使用方法
- LeetCode-38. Count and Say-思路详解-C++