Binary Search Tree Iterator 173

Title Description:

For a binary lookup tree, design an iterator that returns the next minimum value for each call

Topic Analysis:

There's nothing to say. Sequential traversal of two-fork tree

Code:

1 /**2 * Definition for binary tree3 * struct TreeNode {4 * int val;5 * TreeNode *left;6 * TreeNode *right;7 * TreeNode (int x): Val (x), left (null), right (null) {}8  * };9  */Ten classBstiterator { One  Public: ABstiterator (TreeNode *root) { -          -     } the  -     /** @return Whether we have a next smallest number*/ -     BOOLHasnext () { -          +     } -  +     /** @return The next smallest number*/ A     intNext () { at          -     } - }; -  - /** - * Your Bstiterator 'll be a called like this: in * Bstiterator i = bstiterator (root); - * while (I.hasnext ()) cout << i.next (); to  */

Binary Search Tree Iterator 173