Binary Search Tree Iterator 173

Source: Internet
Author: User

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

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.