二叉树基本操作c实现

头文件:

/*
  Name: 二叉树基本操作
  Author: Unimen
  Date: 2011/10/6 23:42:57
*/

#ifndef _BITREE_H_
#define _BITREE_H_

const int maxn = 100;   //树结点的个数 
typedef char ElemType;

typedef struct node
{
	ElemType value;
	struct node *pLChild, *pRChild;
}BiTNode, *PBiTNode;

//前序建立二叉树
void CreateBiTree(PBiTNode &root);
//二叉树前序递归遍历
void RecurPreOrder(PBiTNode root);
//二叉对前序遍历非递归
void PreOrder(PBiTNode root); 
//二叉树中序递归遍历
void RecurInOrder(PBiTNode root); 
//二叉树中序遍历非递归 
void InOrder(PBiTNode root); 
//二叉树后序递归遍历
void RecurPostOrder(PBiTNode root);
//二叉树后序遍历非递归
void PostOrder(PBiTNode root); 
//按层遍历即广搜
void bfs(PBiTNode root); 


#endif

函数实现文件

/*
  Name: 二叉树基本操作
  Author: Unimen
  Date: 2011/10/6 23:42:57
*/

#include <iostream>
#include <cassert>
#include "BiTree.h"
using namespace std;

void CreateBiTree(PBiTNode &root)
{
	char ch;
	ch = cin.get();
	if (' ' == ch)
	{
		while ((ch=cin.get()) != '\n');
		root = NULL;
	}
	else
	{
		root = new BiTNode;
		root->value = ch;
		while ((ch=cin.get()) != '\n');
		CreateBiTree(root->pLChild);
		CreateBiTree(root->pRChild);
	}
}

void RecurPreOrder(PBiTNode root)
{
	if (root != NULL)
	{
		cout<<root->value<<" ";
		PreOrder(root->pLChild);
		PreOrder(root->pRChild);
	}
}

void PreOrder(PBiTNode root)
{
	assert(root);
	
	PBiTNode stack[maxn];
	int top = 0;
	++top;
	stack[top] = root;
	while (top > 0)
	{
		root = stack[top];
		--top;
		cout<<root->value<<" ";
		
		if (root->pRChild != NULL)
		{
			++top;
			stack[top] = root->pRChild;
		}
		if (root->pLChild != NULL)
		{
			++top;
			stack[top] = root->pLChild;
		}
	}
}

void RecurInOrder(PBiTNode root)
{
	if (root != NULL)
	{
		RecurInOrder(root->pLChild);
		cout<<root->value<<" ";
		RecurInOrder(root->pRChild);
	}
}

void InOrder(PBiTNode root)
{
	assert(root);
	
	PBiTNode stack[maxn];
	int top = 0;
	PBiTNode temp = NULL;
	while (root!=NULL || top>0)
	{
		if (root != NULL)
		{
			++top;
			stack[top] = root;
			root = root->pLChild;
		}
		else
		{
			temp = stack[top];
			--top;
			cout<<temp->value<<" ";
			root = temp->pRChild;
		}
	}
}

void RecurPostOrder(PBiTNode root)
{
	if (root != NULL)
	{
		RecurPostOrder(root->pLChild);
		RecurPostOrder(root->pRChild);
		cout<<root->value<<" ";
	}
}

//进栈向左移,出栈向右看,访问了就访问,没访问向右传
void PostOrder(PBiTNode root)
{
	assert(root);

	bool bVisitedRight[maxn] = {false};
	PBiTNode stack[maxn];
	int top = 0;
	PBiTNode temp = NULL;
	
	while (root!=NULL || top>0)
	{
		if (root != NULL)
		{
			++top;
			stack[top] = root;
			root = root->pLChild;
			bVisitedRight[top] = false;
		}	
		else
		{
			temp = stack[top];
			if (bVisitedRight[top] == true)
			{
				cout<<temp->value<<" ";
				--top;
			}
			else
			{
				bVisitedRight[top] = true;
				root = temp->pRChild;	
			}	
		}
	}
}

void bfs(PBiTNode root)
{
	assert(root);
	
	PBiTNode queue[maxn];
	PBiTNode temp = NULL;
	int front, near;
	near = front = 0;
	
	++near;
	queue[near] = root;
	while (front < near)
	{
		front = (front + 1) % maxn;
		temp = queue[front];
		cout<<temp->value<<" ";
		if (temp->pLChild != NULL)
		{
			near = (near + 1) % maxn;
			queue[near] = temp->pLChild;
		}
		if (temp->pRChild != NULL)
		{
			near = (near + 1) % maxn;
			queue[near] = temp->pRChild;
		}
	}
}

功能测试:

/*
  Name: 二叉树基本操作
  Author: Unimen
  Date: 2011/10/6 23:42:57
*/

#include <iostream>
#include "BiTree.h"
using namespace std;

int main()
{
	PBiTNode root;
	CreateBiTree(root);
	
	cout<<"递归前序遍历:  ";
	RecurPreOrder(root);
	cout<<endl;
	cout<<"非递归前序遍历:";
	PreOrder(root);
	cout<<endl;
	
	cout<<"递归中序遍历:  ";
	RecurInOrder(root);
	cout<<endl;
	cout<<"非递归中序遍历:";
	InOrder(root);
	cout<<endl;
	
	cout<<"递归后序遍历:  ";
	RecurPostOrder(root);
	cout<<endl;
	cout<<"非递归后序遍历:";
	PostOrder(root);
	cout<<endl;
	
	cout<<"按层遍历:";
	bfs(root);
	cout<<endl;

	return 0;
}



  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
以下是二叉树基本操作的C语言实现: ```c #include <stdio.h> #include <stdlib.h> //定义二叉树结构体 typedef struct TreeNode { int data; struct TreeNode* left; struct TreeNode* right; } TreeNode; //创建二叉树节点 TreeNode* createNode(int data) { TreeNode* node = (TreeNode*)malloc(sizeof(TreeNode)); node->data = data; node->left = NULL; node->right = NULL; return node; } //创建二叉树 TreeNode* createTree() { int data; scanf("%d", &data); if (data == -1) { //输入-1表示该节点为空 return NULL; } TreeNode* root = createNode(data); printf("输入%d的左子节点:", data); root->left = createTree(); printf("输入%d的右子节点:", data); root->right = createTree(); return root; } //先序遍历 void preorderTraverse(TreeNode* root) { if (root == NULL) { return; } printf("%d ", root->data); preorderTraverse(root->left); preorderTraverse(root->right); } //序遍历 void inorderTraverse(TreeNode* root) { if (root == NULL) { return; } inorderTraverse(root->left); printf("%d ", root->data); inorderTraverse(root->right); } //后序遍历 void postorderTraverse(TreeNode* root) { if (root == NULL) { return; } postorderTraverse(root->left); postorderTraverse(root->right); printf("%d ", root->data); } //层序遍历 void levelorderTraverse(TreeNode* root) { if (root == NULL) { return; } TreeNode* queue[1000]; int front = 0, rear = 0; queue[rear++] = root; while (front < rear) { TreeNode* node = queue[front++]; printf("%d ", node->data); if (node->left) { queue[rear++] = node->left; } if (node->right) { queue[rear++] = node->right; } } } //插入节点 void insertNode(TreeNode* root, int data) { if (root == NULL) { return; } if (root->left == NULL) { root->left = createNode(data); } else if (root->right == NULL) { root->right = createNode(data); } else { //如果当前节点的左右子节点都不为空,则递归插入左右子树 insertNode(root->left, data); insertNode(root->right, data); } } //删除节点 void deleteNode(TreeNode* root, int data) { if (root == NULL) { return; } if (root->left != NULL && root->left->data == data) { free(root->left); root->left = NULL; } else if (root->right != NULL && root->right->data == data) { free(root->right); root->right = NULL; } else { //如果当前节点的左右子节点都不为空,则递归删除左右子树 deleteNode(root->left, data); deleteNode(root->right, data); } } //查找节点 TreeNode* searchNode(TreeNode* root, int data) { if (root == NULL) { return NULL; } if (root->data == data) { return root; } TreeNode* left = searchNode(root->left, data); TreeNode* right = searchNode(root->right, data); if (left != NULL) { return left; } if (right != NULL) { return right; } return NULL; } //修改节点 void modifyNode(TreeNode* node, int newData) { if (node == NULL) { return; } node->data = newData; } int main() { printf("输入二叉树的根节点:"); TreeNode* root = createTree(); printf("先序遍历:"); preorderTraverse(root); printf("\n序遍历:"); inorderTraverse(root); printf("\n后序遍历:"); postorderTraverse(root); printf("\n层序遍历:"); levelorderTraverse(root); printf("\n插入节点5后:"); insertNode(root, 5); levelorderTraverse(root); printf("\n删除节点5后:"); deleteNode(root, 5); levelorderTraverse(root); printf("\n查找节点3:"); TreeNode* node = searchNode(root, 3); if (node != NULL) { printf("找到了,节点的值为%d\n", node->data); } else { printf("没找到\n"); } printf("修改节点3的值为10后:"); modifyNode(node, 10); levelorderTraverse(root); return 0; } ``` 这段代码实现二叉树的创建、遍历、插入、删除、查找和修改等基本操作
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值