C++实现二叉树的创建

简单二叉树的创建

#include<iostream>
using namespace std;
//简单二叉树的创建## 
class BinaryTree {
public:
	//初始化
	BinaryTree(int val) {
		this->val = val;
		this->leftChild = nullptr;
		this->rightChild = nullptr;
	}
	//插入左子节点
	void insertLeft(int newNode) {
		if (this->leftChild == nullptr) {
			this->leftChild = new BinaryTree(newNode);
		}
		else {
			BinaryTree* t = new BinaryTree(newNode);
			t->leftChild = this->leftChild;
			this->leftChild = t;
		}
	}
	//插入右子节点
	void insertRight(int newNode) {
		if (this->rightChild == nullptr) {
			this->rightChild = new BinaryTree(newNode);
		}
		else {
			BinaryTree* t = new BinaryTree(newNode);
			t->rightChild = this->rightChild;
			this->rightChild = t;
		}
	}
	//访问左子节点
	BinaryTree* getleftChild() {
		return this->leftChild;
	}
	//访问右子节点
	BinaryTree* getRightChild() {
		return this->rightChild;
	}
	//设置当前节点的值
	void setRootVal(int val) {
		this->val = val;
	}
	//访问当前节点的值
	int getRootVal() {
		return this->val;
	}
	int val;
	BinaryTree* leftChild;
	BinaryTree* rightChild;
};

//测试
void test01() {
	BinaryTree* tree1 = new BinaryTree(2);
	cout << tree1->val << endl;
	tree1->insertLeft(3);
	cout << tree1->getleftChild()->getRootVal() << endl;
}

void main() {
	test01();
	system("pause");
}