Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /**
- * Definition for a binary tree node.
- * struct TreeNode {
- * int val;
- * TreeNode *left;
- * TreeNode *right;
- * TreeNode() : val(0), left(nullptr), right(nullptr) {}
- * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
- * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
- * };
- */
- class Solution {
- public:
- int kthSmallest(TreeNode* root, int k) {
- stack<TreeNode*> stk;
- while(true){
- while(root){
- stk.push(root);
- root = root->left;
- }
- root = stk.top();
- stk.pop();
- if(--k == 0) return root->val;
- root = root->right;
- }
- return NULL;
- }
- };
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement