C++ 二叉树的构建及使用

C++中二叉树的构建及使用：

---

二叉树的构建：

代码：

struct TreeNode
{
	int val;
	struct TreeNode* left;
	struct TreeNode* right;
	struct TreeNode() :left(nullptr), right(nullptr) {}
};

---

二叉树的初始化：

代码：

TreeNode* creatTreeNode(TreeNode* root, int val)
{
	if (root == nullptr)
	{
		root = new TreeNode();
		root->val = val;
		return root;
	}

	if (val < root->val)
	{
		root->left = creatTreeNode(root->left, val);
	}
	else if (val > root->val)
	{
		root->right = creatTreeNode(root->right,val);
	}

	return root;
}

---

二叉树的使用：

简单的实现一个先序遍历功能来演示二叉树的使用：

void preOrder(TreeNode* root)
{
	if (root == nullptr)
	{
		return;
	}
	cout << root->val;
	preOrder(root->left);
	preOrder(root->right);
}

---

完整代码：

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

struct TreeNode
{
	int val;
	struct TreeNode* left;
	struct TreeNode* right;
	struct TreeNode() :left(nullptr), right(nullptr) {}
};

TreeNode* creatTreeNode(TreeNode* root, int val)
{
	if (root == nullptr)
	{
		root = new TreeNode();
		root->val = val;
		return root;
	}

	if (val < root->val)
	{
		root->left = creatTreeNode(root->left, val);
	}
	else if (val > root->val)
	{
		root->right = creatTreeNode(root->right,val);
	}

	return root;
}

void preOrder(TreeNode* root)
{
	if (root == nullptr)
	{
		return;
	}
	cout << root->val;
	preOrder(root->left);
	preOrder(root->right);
}

int mian()
{
	//二叉树的构造与遍历
	vector<int> vecTree;
	vecTree.push_back(5);
	vecTree.push_back(4);
	vecTree.push_back(6);
	vecTree.push_back(3);
	vecTree.push_back(7);
	TreeNode* root = nullptr;
	for (int i = 0; i < vecTree.size(); i++)
	{
		root = creatTreeNode(root,vecTree[i]);
	}
	preOrder(root);
	cout << endl;
	
	getchar();
	return 0;
}

---