update

Author: kamyu104

Python/binary-search-tree-iterator.py

@@ -1,3 +1,15 @@
+# Time:  O(1)
+# Space: O(logn)
+# 
+# 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 a  binary tree node
 class TreeNode:
     def __init__(self, x):
@@ -30,6 +42,9 @@ def next(self):
 if __name__ == "__main__":
     root = TreeNode(2)
     root.left = TreeNode(1)
+    
+    # Your BSTIterator will be called like this:
     i, v = BSTIterator(root), []
     while i.hasNext(): v.append(i.next())
+    
     print v