二叉树非递归前中后序遍历 C++ 实现

该代码段定义了一个Solution类,包含一个Traversal函数,用于使用栈进行二叉树的遍历。函数接受一个TreeNode指针作为根节点,返回一个整数向量,包含了按照前序、中序和后序顺序遍历得到的节点值。遍历过程中,使用了一个pair来存储节点和访问状态,确保了正确地遍历所有节点。
摘要由CSDN通过智能技术生成
class Solution {
public:
    vector<int> Traversal(TreeNode* root) {
        vector<int> res;
        stack<pair<TreeNode*, bool>> st; //存储节点和访问标志的栈。
        pair<TreeNode*, bool> cur = {root, false}; //当前处理的节点以及其访问标志, true:准备访问, false:未访问
        if(!cur.first) return res;
        st.push(cur);
        while(!st.empty()){
            cur = st.top(); //取当前节点
            st.pop();
            if(cur.second == true){ //访问节点
                res.push_back(cur.first->val);
            }else{ //准备节点
                //先序遍历
                if(cur.first->right) st.push({cur.first->right, false});
                if(cur.first->left) st.push({cur.first->left, false});
                st.push({cur.first, true});
                //中序遍历
                if(cur.first->right) st.push({cur.first->right, false});
                st.push({cur.first, true});
                if(cur.first->left) st.push({cur.first->left, false});
                //后续遍历
                st.push({cur.first, true});
                if(cur.first->right) st.push({cur.first->right, false});
                if(cur.first->left) st.push({cur.first->left, false});
            }
        }
        return res;
    }
};
以下是二叉树前中后序遍历C++ 代码: ```c++ #include <iostream> #include <stack> using namespace std; struct TreeNode { int val; TreeNode* left; TreeNode* right; TreeNode(int x) : val(x), left(NULL), right(NULL) {} }; // 前序遍历 void preorderTraversal(TreeNode* root) { if (root == NULL) return; cout << root->val << " "; preorderTraversal(root->left); preorderTraversal(root->right); } // 中序遍历 void inorderTraversal(TreeNode* root) { if (root == NULL) return; inorderTraversal(root->left); cout << root->val << " "; inorderTraversal(root->right); } // 后序遍历 void postorderTraversal(TreeNode* root) { if (root == NULL) return; postorderTraversal(root->left); postorderTraversal(root->right); cout << root->val << " "; } // 非递归前序遍历 void preorderTraversalNonRecursive(TreeNode* root) { if (root == NULL) return; stack<TreeNode*> s; s.push(root); while (!s.empty()) { TreeNode* curr = s.top(); s.pop(); cout << curr->val << " "; if (curr->right != NULL) s.push(curr->right); if (curr->left != NULL) s.push(curr->left); } } // 非递归中序遍历 void inorderTraversalNonRecursive(TreeNode* root) { if (root == NULL) return; stack<TreeNode*> s; TreeNode* curr = root; while (curr != NULL || !s.empty()) { while (curr != NULL) { s.push(curr); curr = curr->left; } curr = s.top(); s.pop(); cout << curr->val << " "; curr = curr->right; } } // 非递归后序遍历 void postorderTraversalNonRecursive(TreeNode* root) { if (root == NULL) return; stack<TreeNode*> s1, s2; s1.push(root); while (!s1.empty()) { TreeNode* curr = s1.top(); s1.pop(); s2.push(curr); if (curr->left != NULL) s1.push(curr->left); if (curr->right != NULL) s1.push(curr->right); } while (!s2.empty()) { cout << s2.top()->val << " "; s2.pop(); } } int main() { TreeNode* root = new TreeNode(1); root->left = new TreeNode(2); root->right = new TreeNode(3); root->left->left = new TreeNode(4); root->left->right = new TreeNode(5); root->right->left = new TreeNode(6); root->right->right = new TreeNode(7); cout << "Preorder traversal: "; preorderTraversal(root); cout << endl; cout << "Inorder traversal: "; inorderTraversal(root); cout << endl; cout << "Postorder traversal: "; postorderTraversal(root); cout << endl; cout << "Non-recursive preorder traversal: "; preorderTraversalNonRecursive(root); cout << endl; cout << "Non-recursive inorder traversal: "; inorderTraversalNonRecursive(root); cout << endl; cout << "Non-recursive postorder traversal: "; postorderTraversalNonRecursive(root); cout << endl; return 0; } ``` 输出结果为: ``` Preorder traversal: 1 2 4 5 3 6 7 Inorder traversal: 4 2 5 1 6 3 7 Postorder traversal: 4 5 2 6 7 3 1 Non-recursive preorder traversal: 1 2 4 5 3 6 7 Non-recursive inorder traversal: 4 2 5 1 6 3 7 Non-recursive postorder traversal: 4 5 2 6 7 3 1 ```
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值