Leetcode: 173. Binary Search Tree Iterator

Question:

mplement 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.

Solution:

	public class BSTIterator {
		private Stack<TreeNode> stack;
		public BSTIterator(TreeNode root) {
			stack = new Stack<>();
			TreeNode node = root;
			while (node != null) {
				stack.push(node);
				node = node.left;
			}
		}
		
		public boolean hasNext() {
			return !stack.isEmpty();
		}

		public int next() {
			TreeNode node = stack.pop();
			int n = node.val;
			if (node.right != null) {
				node = node.right;
				while (node != null) {
					stack.push(node);
					node = node.left;
				}
			}
			return n;
		}
	}

Note:

1. Binary Search Tree is a node-based binary tree data structure which has the following properties:
   1. The left subtree of a node contains only nodes with keys lesser than the node’s key.
   2. The right subtree of a node contains only nodes with keys greater than the node’s key.
   3. The left and right subtree each must also be a binary search tree.
2. When the program touch a new node, it will push all nodes less than it in the stack first, which guarantees that all nodes are pushed in the stack.