数据结构与算法-二叉树

#include

struct binaryTreeNode {
	int data;
	struct binaryTreeNode* leffchild;
	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->leffchild);
		createBinaryTree(tree->rightchild);
	}
}

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

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

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

int main() {
	return 0;
}