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

最新推荐文章于 2024-07-17 16:44:46 发布

paradox_1_0

最新推荐文章于 2024-07-17 16:44:46 发布

阅读量164

点赞数

分类专栏：【算法】

本文链接：https://blog.csdn.net/paradox_1_0/article/details/106334580

版权

【算法】专栏收录该内容

114 篇文章 2 订阅

订阅专栏

 // 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;
                         }
                 }
         }
 }