二叉树

二叉树结构 

//Definition for a binary tree node.
struct TreeNode {
    int val;
    TreeNode *left;
    TreeNode *right;
    TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};

1、前序 beat 100%

 

144. Binary Tree Preorder Traversal

弹出打印，先压右再压左， 压人顺序：中右左  弹出打印顺序：中左右

class Solution {
public:
    vector<int> preorderTraversal(TreeNode* root) {
        vector<int> res;
        if(root==NULL ) return res;
        stack<TreeNode*> s;
        s.push(root);
        while(!s.empty()){
            root=s.top();
            s.pop();
            res.push_back(root->val);
            if(root->right){
                s.push(root->right);
            }
            if(root->left){
                s.push(root->left);
            }
        }
        return res;
    }
};

2、中序 beat100%

94. Binary Tree Inorder Traversal

判断 不为空 一直压左节点，为空 弹出打印 指向右节点

class Solution {
public:
    vector<int> inorderTraversal(TreeNode* root) {
        vector<int> res;
        if(root ==NULL) return res;
        stack<TreeNode* > s;
        while(root || !s.empty()){
            if(root){
                s.push(root);
                root=root->left;
            }
            else{
                root=s.top();
                s.pop();
                res.push_back(root->val);
                root=root->right;
            }
        }
        return res;
    }
};

3、后序 beat100%

145. Binary Tree Postorder Traversal

方法一：两个栈  把所有要打印的都push到s2中，统一打印

先序：压栈     ：中右左 打 印：中左右

后序：压栈s1：中左右 压栈s2:中右左 打印：左右中  

class Solution {
public:
    vector<int> postorderTraversal(TreeNode* root) {
        vector<int> res;
        if(root==NULL) return res;
        stack<TreeNode*> s1;
        stack<TreeNode*> s2;
        s1.push(root);
        while(!s1.empty()){
            root=s1.top();
            s1.pop();
            s2.push(root);
            if(root->left){
                s1.push(root->left);
            }
            if(root->right){
                s1.push(root->right);
            }
        }
        while(!s2.empty()){
            root=s2.top();
            s2.pop();
            res.push_back(root->val);
        }
        return res;
    }
};

方法二：判断栈顶c与root关系

1、如果c有左孩子且root不是c的孩子 把c做孩子压栈
2、如果c有右孩子且root不是c的右孩子，把c右孩子压栈
3、其他情况打印c的值，令root=c

class Solution {
public:
    vector&