ICode9

精准搜索请尝试: 精确搜索
首页 > 其他分享> 文章详细

二叉树前序遍历

2021-06-11 02:04:58  阅读:15  来源: 互联网

标签:std 遍历 前序 vector st BinaryTreeNode right 二叉树 result


#include <iostream>
#include <vector>
#include <stack>

struct BinaryTreeNode{
    int val;
    BinaryTreeNode* left;
    BinaryTreeNode* right;
    BinaryTreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
};

//递归法
void traveral(BinaryTreeNode*cur, std::vector<int>&nums)
{
    if (cur == nullptr)
    {
        std::cout << "cur is null" << std::endl;
        return;
    }
    else{
        std::cout << "cur node: " << cur->val << ", ";
        nums.push_back(cur->val);
        std::cout << "traveral left" << ", ";
        traveral(cur->left, nums);
        std::cout << "traveral right" << ", ";
        traveral(cur->right, nums);
    }
}


std::vector<int> PreorderTraversalRecursion(BinaryTreeNode* root)
{
    std::vector<int> result;
    traveral(root, result);
    return result;
}

//迭代法
std::vector<int> PreorderTraversalIterator(BinaryTreeNode* root)
{
    std::stack<BinaryTreeNode*> st;
    std::vector<int> result;
    if (root == nullptr)
    {
        return result;
    }

    st.push(root);//root进栈
    while (!st.empty())
    {
        BinaryTreeNode* node = st.top();//根

        st.pop();//弹出
        result.push_back(node->val);//当前节点值
        if (node->right)
        {
            st.push(node->right);//右节点
        }
        if (node->left)
        {
            st.push(node->left);//左节点
        }
    }
    return result;
}

int main()
{
    BinaryTreeNode *nodeOne = new BinaryTreeNode(1);
    BinaryTreeNode *nodeTwo = new BinaryTreeNode(2);
    BinaryTreeNode*nodeThree = new BinaryTreeNode(3);
    BinaryTreeNode*nodeFour = new BinaryTreeNode(4);
    BinaryTreeNode*nodeFive = new BinaryTreeNode(5);
    BinaryTreeNode*nodeSix = new BinaryTreeNode(6);

    //       1
   //      2   3
  //      4 5
 //          6
//1-2-4-5-6-3
    nodeOne->left = nodeTwo;
    nodeOne->right = nodeThree;

    nodeTwo->left = nodeFour;
    nodeTwo->right = nodeFive;

    nodeFive->right = nodeSix;

    std::vector<int>resultsRecursion;
    resultsRecursion = PreorderTraversalRecursion(nodeOne);
    for (std::vector<int>::iterator it = resultsRecursion.begin(); it != resultsRecursion.end(); it++)
    {
        std::cout << (*it) << ", ";
    }

    std::cout << std::endl<< "-------------------------------------" << std::endl;
    std::vector<int>resultsIteration;
    resultsIteration = PreorderTraversalIterator(nodeOne);
    for (std::vector<int>::iterator it = resultsIteration.begin(); it != resultsIteration.end(); it++)
    {
        std::cout << (*it) << ", ";
    }
}

 

标签:std,遍历,前序,vector,st,BinaryTreeNode,right,二叉树,result
来源: https://www.cnblogs.com/crazybird123/p/14873531.html

专注分享技术,共同学习,共同进步。侵权联系[admin#icode9.com]

Copyright (C)ICode9.com, All Rights Reserved.

ICode9版权所有