数据结构与算法-二叉树

萌萌哒的喵喵饼

已于 2022-07-16 19:49:31 修改

阅读量248

点赞数

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

于 2022-07-12 22:36:04 首次发布

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

版权

c++ 同时被 2 个专栏收录

11 篇文章 0 订阅

订阅专栏

c语言

11 篇文章 2 订阅

订阅专栏

#include<iostream>

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

void createBinaryTree(struct binaryTreeNode* tree) {
	char ch;
	std::cin >> ch;
	if (ch == -1) {
		tree = nullptr;
		return;
	}
	else {
		tree = new binaryTreeNode;
		tree->data = ch;
		createBinaryTree(tree->leftchild);
		createBinaryTree(tree->rightchild);
	}
}

void showTreeByPreOrder(struct binaryTreeNode* tree) {
	if (tree == nullptr) {
		return;
	}
	else {
		std::cout << tree->data << std::endl;
		showTreeByPreOrder(tree->leftchild);
		showTreeByPreOrder(tree->rightchild);
	}
}

void showTreeByInOrder(struct binaryTreeNode* tree) {
	if (tree == nullptr) {
		return;
	}
	else {
		showTreeByInOrder(tree->leftchild);
		std::cout << tree->data << std::endl;
		showTreeByInOrder(tree->rightchild);
	}
}

void showTreeByPosOrder(struct binaryTreeNode* tree) {
	if (tree == nullptr) {
		return;
	}
	else {
		showTreeByPosOrder(tree->leftchild);
		showTreeByPosOrder(tree->rightchild);
		std::cout << tree->data << std::endl;
	}
}

int main() {
	return 0;
}