中序遍历和后序遍历的迭代法

98. Validate Binary Search Tree
    Medium

1428

223

Favorite

Share
Given a binary tree, determine if it is a valid binary search tree (BST).

Assume a BST is defined as follows:

The left subtree of a node contains only nodes with keys less than the node’s key.
The right subtree of a node contains only nodes with keys greater than the node’s key.
Both the left and right subtrees must also be binary search trees.
Example 1:

Input:
2
/
1 3
Output: true
Example 2:

5

/
1 4
/
3 6
Output: false
Explanation: The input is: [5,1,4,null,null,3,6]. The root node’s value
is 5 but its right child’s value is 4.

用栈存储 直接存到树的最左子树
非常好的方法

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    bool isValidBST(TreeNode* root) {   
        stack<TreeNode*> s;
        if(root==nullptr) return true;
        TreeNode* prev = nullptr;
        while(!s.empty()||root!=nullptr){
            while(root!=nullptr){
                s.push(root);
                root = root->left;
            }
            root = s.top();s.pop();
            if(prev!=nullptr && prev->val>=root->val) return false;
            prev = root;
            root = root->right;
        }
        return true;
    }
 
};

后序遍历

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<int> postorderTraversal(TreeNode* root) {
        stack<TreeNode*> s;
        vector<int> res;
        TreeNode* cur = root;
        TreeNode* pre = nullptr;
        while(!s.empty()||cur!=nullptr){
            while(cur!=nullptr){
                s.push(cur);
                cur = cur->left;
            }
            cur = s.top();
            if(cur->right!=nullptr && pre!=cur->right){
                cur = cur->right;
            }
            else{
                pre = cur;
                res.push_back(pre->val);
                s.pop();
                cur = nullptr;
            }
        }
        return res;
    }
};