建立一棵二叉树并对其进行中序遍历

最新推荐文章于 2023-05-07 16:17:22 发布

前行_的路上

最新推荐文章于 2023-05-07 16:17:22 发布

阅读量829

点赞数

分类专栏： c++ 文章标签：蓝桥杯 c++ 算法

本文链接：https://blog.csdn.net/ZhaoLinke1998/article/details/123197184

版权

二叉树中序遍历递归 C++ 数据结构

关键词由CSDN通过智能技术生成

c++ 专栏收录该内容

23 篇文章 0 订阅

订阅专栏

#include <iostream>
using namespace std;
#include <vector>


struct TreeNode {
      int val;
      TreeNode *left;
      TreeNode *right;
      TreeNode() : val(0), left(nullptr), right(nullptr) {}
      TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
      TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
  };
 
TreeNode* newTreeNode(int data) {
    TreeNode* t = new TreeNode;
    t->val = data;
    t->left = nullptr;
    t->right = nullptr;
    return t;
}

TreeNode* creatTree(vector<int>& nums, int n, int index) {
    TreeNode* node = nullptr;
    if (index < n && nums[index] != -1) {
        node = newTreeNode(nums[index]);
        node->left = creatTree(nums, n, 2 * index + 1);
        node->right = creatTree(nums, n, 2 * index + 2);
    }
    return node;
}

//递归法对二叉树进行中序遍历
vector<int> ret;
void helper(TreeNode* root) {
    if (root == nullptr) return;
    helper(root->left);
    ret.push_back(root->val);
    helper(root->right);
}

vector<int> midOrder(TreeNode* root) {
    if (root == nullptr) return ret;
    helper(root);
    return ret;
}

int main() {
    vector<int> nums = { 2,3,4,10,-1 };
    TreeNode* root = creatTree(nums, nums.size(), 0);
    vector<int> nums1 = midOrder(root);
    for (int x : nums1) {
        cout << x << endl;
    }
    system("pause");
    return 0;
}