二叉树遍历 @ oj.leetcode.com

最新推荐文章于 2024-07-02 15:36:37 发布

wwwwwwking

最新推荐文章于 2024-07-02 15:36:37 发布

阅读量330

点赞数

分类专栏：笔试面试

本文链接：https://blog.csdn.net/wwwwwwking/article/details/16360833

版权

笔试面试专栏收录该内容

6 篇文章 0 订阅

订阅专栏

测试地址链接：

前序遍历：http://oj.leetcode.com/problems/binary-tree-preorder-traversal/

后续遍历：http://oj.leetcode.com/problems/binary-tree-postorder-traversal/

最基础的数据结构知识，很多二叉树的操作都是基于遍历来实现的，在递归时一定要注意遍历的顺序。直接贴代码吧

前序：

/**
 * 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) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        vector<int> v;
        Traverse(v, root);
        return v;
    }
    
    void Traverse(vector<int> &v, TreeNode *p) {
        if (p == NULL) return;
        v.push_back(p->val);
        if (p->left != NULL)
            Traverse(v, p->left);
        if (p->right != NULL)
            Traverse(v, p->right);
    }
};

后序

/**
 * 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> postorderTraversal(TreeNode *root) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        vector<int> returnValue;
        Traverse(returnValue, root);
        return returnValue;
    }
    
    void Traverse(vector<int> &ret, TreeNode *node)
    {
        if (node == NULL) return;
        if (node->left != NULL)
            Traverse(ret, node->left);
        if (node->right != NULL)
            Traverse(ret, node->right);
        ret.push_back(node->val);
    }
};