面试算法题. 二叉树前、中、后序遍历的迭代版本. 简单复习

本文链接：https://blog.youkuaiyun.com/paradox_1_0/article/details/106334580

本文详细介绍了二叉树的三种遍历算法：先序遍历、中序遍历和后序遍历。通过使用栈数据结构，文章提供了具体的实现代码，帮助读者深入理解每种遍历方式的工作原理。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

 // 1. 先序遍历

 void FirstSearch(TreeNode* root) {

         if (nullptr == root)
                 return;

         stack<TreeNode*> stack_;
         stack_.push(root);

         while (stack_.size()) {

                 TreeNode* node = stack_.top();
                 stack_.pop();

                 // 处理当前节点
                 cout << node->val << endl;

                 if (nullptr != node->right) 
                         stack_.push(node->right);
                 if (nullptr != node->left)
                         stack_.push(node->left);
         }     
 } 

// 2. 中序遍历
 void MiddleSearch(TreeNode* root) {

         if (nullptr == root)
                 return;

         stack<TreeNode*> stack_;
         stack_.push(root);

         while (stack_.size()) {

                 while (nullptr != root->left) {

                         stack_.push(root->left);
                         root = root->left;
                 }
                
                 while (stack_.size()) {

                         TreeNode* node = stack_.top();
                         stack_.pop();

                         // 处理节点
                         cout << node->val << endl;

                         if (nullptr != node->right) {

                                 stack_.push(node->right);
                                 root = node->right;
                                 break;
                         }
                 }
         }
 }

 // 3. 后序遍历
 
 void BackSearch(TreeNode* root) {

         if (nullptr == root)
                 return;

         stack<TreeNode*> stack_;
         stack_.push(root);
         TreeNode* lastNode = nullptr;

         while (stack_.size()) {

                 while (nullptr != root->left) {

                         stack_.push(root->left);
                         root = root->left;
                 }

                 while (stack_.size()) {

                         if (lastNode == stack_.top()->right || nullptr == stack_.top()->right) {

                                 TreeNode* node = stack_.top();
                                 stack_.pop();
                                 cout << node->val << endl;
                                 lastNode = node;
                         }
                         else {
                                 root = stack_.top()->right;
                                 stack_.push(root);
                                 break;
                         }
                 }
         }
 }