Binary Tree Preorder Traversal

最新推荐文章于 2022-11-29 02:00:43 发布

早迎朝阳晚迎星光

最新推荐文章于 2022-11-29 02:00:43 发布

阅读量494

点赞数

分类专栏： LeetCode 文章标签：算法递归

本文链接：https://blog.csdn.net/Staibin/article/details/37903793

版权

LeetCode 专栏收录该内容

17 篇文章

订阅专栏

本文介绍二叉树的前序遍历算法，包括递归和迭代两种实现方式，并提供详细的C++代码示例。分析了算法的时间复杂度。

摘要由CSDN通过智能技术生成

题目

Given a binary tree, return the preorder traversal of its nodes' values.

For example:
Given binary tree {1,#,2,3},

return [1,2,3].

Note: Recursive solution is trivial, could you do it iteratively?

分析

递归：CODE 1

迭代：CODE 2 、 CODE 3

复杂度

O(n)

输入

CODE

CODE 1：递归

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<int> preorderTraversal(TreeNode *root) {
        if (root == NULL) {
            return result;
        }
        result.push_back(root->val);
        if (root->left) {
            preorderTraversal(root->left);
        }
        if (root->right) {
            preorderTraversal(root->right);
        }
        return result;
    }

private :
    vector<int> result;
};

CDOE 2：仅非空右节点入栈

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<int> preorderTraversal(TreeNode *root) {
        mystack.push(NULL);  // 设定结束条件，要不是空树，不遍历空节点
        while(!(root == NULL && mystack.empty())) {
            if (root == NULL) {
                // 空树
                break;
            } else {
                result.push_back(root->val);
                if (root->right) {
                    mystack.push(root->right);
                }
                // next node
                if (root->left) {
                    root = root->left;
                } else {
                    root = mystack.top();
                    mystack.pop();
                }
            }
        }
        return result;
    }

private :
    vector<int> result;
    stack<TreeNode *> mystack;
};

CODE 3：所有需要遍历的点都入栈

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<int> preorderTraversal(TreeNode *root) {
        if (root == NULL) {
            return result;
        }
        mystack.push(root);
        while (!mystack.empty()) {
            root = mystack.top();
            mystack.pop();
            result.push_back(root->val);
            if (root->right) {
                mystack.push(root->right);
            }
            if (root->left) {
                mystack.push(root->left);
            }
        }
        return result;
    }

private :
    vector<int> result;
    stack<TreeNode *> mystack;
};