Kth smallest Element in a BST

The idea of this problem is very simple, that is, the first sequence of BST traversal, the number of K to find the time to return. With the help of the stack iteration, the recursive code is simpler and no attempt is made.

Class Solution {public:    int kthsmallest (treenode* root, int k) {        stack<treenode *> cache;        TreeNode *point = root;        TreeNode *tmp;        int i = 0;//the first-order traversal        while (Point | |!cache.empty ()) {and point            } {                Cache.push (point);                Point = left;            if (!cache.empty ()) {                tmp = Cache.top ();                i++;                if (i = = k)                    return tmp, Val;                Cache.pop ();                Point = tmp, right;}}}    ;

Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.

Kth smallest Element in a BST