BST iterator

Author: nch3ng

Binary Search Tree Iterator/Solution.rb

@@ -0,0 +1,31 @@
+# Definition for a binary tree node.
+# class TreeNode
+#     attr_accessor :val, :left, :right
+#     def initialize(val)
+#         @val = val
+#         @left, @right = nil, nil
+#     end
+# end
+
+class BSTIterator
+    # @param {TreeNode} root
+    def initialize(root)
+        
+    end
+
+    # @return {Boolean}
+    def has_next
+        
+    end
+
+    # @return {Integer}
+    def next
+        
+    end
+end
+
+# Your BSTIterator will be called like this:
+# i, v = BSTIterator.new(root), []
+# while i.has_next()
+#    v << i.next
+# end