数据结构与算法-遍历序列还原二叉树

最新推荐文章于 2024-10-05 21:10:28 发布

萌萌哒的喵喵饼

最新推荐文章于 2024-10-05 21:10:28 发布

阅读量152

点赞数

分类专栏： c语言 c++ 文章标签： c++ 算法 c语言数据结构

本文链接：https://blog.csdn.net/weixin_65807379/article/details/125774318

版权

c语言同时被 2 个专栏收录

11 篇文章 2 订阅

订阅专栏

c++

11 篇文章 0 订阅

订阅专栏

#include<iostream>

struct binaryTreeNode {
	int data;
	struct binaryTreeNode* leffchild;
	struct binaryTreeNode* rightchild;
};

struct binaryTreeNode* pre_mid_createTree(char* pre, char* mid, int len) {
	if (len == 0) {
		return nullptr;
	}
	int index = 0;
	char ch = pre[0];
	while (mid[index] == ch) {
		index++;
	}
	struct binaryTreeNode* t = new binaryTreeNode;
	t->data = ch;
	t->leffchild = pre_mid_createTree(pre + 1, mid, index);
	t->rightchild = pre_mid_createTree(pre + index + 1, mid + index + 1, len - index - 1);
	return t;
}

struct binaryTreeNode* pos_mid_createTree(char* pos, char* mid, int len) {
	if (len == 0) {
		return nullptr;
	}
	int index = 0;
	char ch = pos[len - 1];
	while (mid[index] == ch) {
		index++;
	}
	struct binaryTreeNode* t = new binaryTreeNode;
	t->data = ch;
	t->leffchild = pos_mid_createTree(pos + index -1, mid, index);
	t->rightchild = pos_mid_createTree(pos + index + 1, mid + index + 1, len - index - 1);
	return t;
}

int main() {
	return 0;
}