简单二叉树功能的实现
下面的有两个功能一是程序遍历,二是判断是否为完全二叉树,里面有用到队列来实现
但是当我们没有学习c++时,要自己实现队列。
BinaryTree.c
#define _CRT_SECURE_NO_WARNINGS 1
#include"Queue.h"
typedef char BTDataType;
typedef struct BinaryTreeNode
{
BTDataType data;
struct BinaryTreeNode* left;
struct BinaryTreeNode* right;
}BTNode;
BTNode* BuyBTNode(BTDataType data)
{
BTNode* node = (BTNode*)malloc(sizeof(BTNode));
if (node == NULL)
return NULL;
node->data = data;
node->left = NULL;
node->right = NULL;
return node;
}
BTNode* BinaryTreeCreate(BTDataType* a, int n, int* pi)
{
if (a[*pi] == '#')
{
(*pi)++;
return NULL;
}
BTNode* node = BuyBTNode(a[*pi]);
(* pi)++;
node->left = BinaryTreeCreate(a, n, pi);
node->right = BinaryTreeCreate(a, n, pi);
return node;
}
void BinaryTreeDestory(BTNode** root)
{
if ((*root) == NULL)
{
return;
}
BinaryTreeDestory(&(*root)->left);
BinaryTreeDestory(&(*root)->right);
free(*root);
*root = NULL;
}
int BinaryTreeSize(BTNode* root)
{
if (root == NULL)
{
return 0;
}
return BinaryTreeSize(root->left) + BinaryTreeSize(root->right) + 1;
}
int TreeSize2(BTNode* root)
{
return root == NULL ? 0 : TreeSize(root->left) + TreeSize(root->right) + 1;
}
int BinaryTreeLeafSize(BTNode* root)
{
if (root == NULL)
{
return 0;
}
if (root->left == NULL && root->right == NULL)
{
return 1;
}
return BinaryTreeLeafSize(root->left) + BinaryTreeLeafSize(root->right);
}
int BinaryTreeLevelKSize(BTNode* root, int k)
{
if (root == NULL)
{
return 0;
}
if (--k == 0)
{
return 1;
}
return BinaryTreeLevelKSize(root->left,k) + BinaryTreeLevelKSize(root->right,k);
}
int TreeKLevel(BTNode* root, int k)
{
assert(k >= 1);
if (root == NULL)
return 0;
if (k == 1)
return 1;
return TreeKLevel(root->left, k - 1) + TreeKLevel(root->right, k - 1);
}
int TreeDepth(BTNode* root)
{
if (root == NULL)
return 0;
int left = TreeDepth(root->left);
int right = TreeDepth(root->right);
return left > right ? left + 1 : right + 1;
}
BTNode* BinaryTreeFind(BTNode* root, BTDataType x)
{
if (root == NULL)
{
return NULL;
}
if (root->data == x)
{
return root;
}
BTNode* tmp1 = BinaryTreeFind(root->left, x);
BTNode* tmp2 = BinaryTreeFind(root->right, x);
return tmp1 == NULL ? tmp2 : tmp1;
}
BTNode* TreeFind2(BTNode* root, BTDataType x)
{
if (root == NULL)
return NULL;
if (root->data == x)
return root;
BTNode* ret1 = TreeFind2(root->left, x);
if (ret1)
return ret1;
BTNode* ret2 = TreeFind2(root->right, x);
if (ret2)
return ret2;
return NULL;
}
void BinaryTreePrevOrder(BTNode* root)
{
if (root == NULL)
{
printf("#->");
return;
}
printf("%c->", root->data);
BinaryTreePrevOrder(root->left);
BinaryTreePrevOrder(root->right);
}
void BinaryTreeInOrder(BTNode* root)
{
if (root == NULL)
{
return;
}
BinaryTreeInOrder(root->left);
printf("%c->", root->data);
BinaryTreeInOrder(root->right);
}
void BinaryTreePostOrder(BTNode* root)
{
if (root == NULL)
{
return;
}
BinaryTreePostOrder(root->left);
BinaryTreePostOrder(root->right);
printf("%c->", root->data);
}
void BinaryTreeLevelOrder(BTNode* root)
{
Queue q;
QueueInit(&q);
if (root)
{
QueuePush(&q, root);
}
while (!QueueEmpty(&q))
{
BTNode* front = QueueFront(&q);
printf("%c ", front->data);
QueuePop(&q);
if (front->left)
{
QueuePush(&q, front->left);
}
if (front->right)
{
QueuePush(&q, front->right);
}
}
printf("\n");
QueueDestroy(&q);
}
int BinaryTreeComplete(BTNode* root)
{
Queue q;
QueueInit(&q);
if (root)
{
QueuePush(&q, root);
}
while (!QueueEmpty(&q))
{
BTNode* front = QueueFront(&q);
QueuePop(&q);
if (front)
{
QueuePush(&q, front->left);
QueuePush(&q, front->right);
}
else
{
break;
}
}
while (!QueueEmpty(&q))
{
BTNode* front = QueueFront(&q);
QueuePop(&q);
if (front)
{
QueueDestroy(&q);
return false;
}
}
QueueDestroy(&q);
return true;
}
BTNode* CreatBinaryTree()
{
BTNode* n1 = BuyBTNode(1);
BTNode* n2 = BuyBTNode(2);
BTNode* n3 = BuyBTNode(3);
BTNode* n4 = BuyBTNode(4);
BTNode* n5 = BuyBTNode(5);
BTNode* n6 = BuyBTNode(6);
n1->left = n2;
n1->right = n4;
n2->left = n3;
n4->left = n5;
n4->right = n6;
return n1;
}
int main()
{
BTNode* CreatBinaryTree();
BTDataType a[] = "ABD##E#H##CF##G##";
int i = 0;
BTNode* BT = BinaryTreeCreate(a, sizeof(a) / sizeof(a[0]), &i);
BinaryTreePrevOrder(BT);
printf("\n");
int size = BinaryTreeSize(BT);
printf("二叉树节点的个数: %d\n", size);
int leafsize = BinaryTreeLeafSize(BT);
printf("叶子节点的个数: %d\n", leafsize);
int k = 5;
int LevelKSize = BinaryTreeLevelKSize(BT, k);
printf("第%d层节点的个数为: %d\n", k, LevelKSize);
BTNode* FindNode = BinaryTreeFind(n1, 3);
printf("找到的节点值:%d \n", FindNode->data);
BinaryTreeLevelOrder(BT);
int TreeC = BinaryTreeComplete(BT);
printf("是不是完全二叉树:%d\n", TreeC);
BinaryTreeDestory(&BT);
BinaryTreeDestory(&n1);
return 0;
}
Queue.h
**里面注意前面的相互引用**
#define _CRT_SECURE_NO_WARNINGS 1
#pragma once
#include<stdio.h>
#include<stdlib.h>
#include<assert.h>
#include<stdbool.h>
struct BinaryTreeNode;
typedef struct BinaryTreeNode* QDataType;
typedef struct QListNode
{
struct QListNode* next;
QDataType data;
}QNode;
typedef struct Queue
{
QNode* head;
QNode* tail;
}Queue;
void QueueInit(Queue* pq);
void QueueDestroy(Queue* pq);
void QueuePush(Queue* pq, QDataType data);
void QueuePop(Queue* pq);
QDataType QueueFront(Queue* pq);
QDataType QueueBack(Queue* pq);
int QueueSize(Queue* pq);
bool QueueEmpty(Queue* pq);
Queue.c
#define _CRT_SECURE_NO_WARNINGS 1
#include"Queue.h"
void QueueInit(Queue* pq)
{
assert(pq);
pq->head = NULL;
pq->tail = NULL;
}
QNode* BuyQueueNode(QDataType data)
{
QNode* temp = (QNode*)malloc(sizeof(QNode));
assert(temp);
temp->next = NULL;
temp->data = data;
return temp;
}
void QueueDestroy(Queue* pq)
{
assert(pq);
QNode* cur = pq->head;
while (cur)
{
QNode* next = cur->next;
free(cur);
cur = next;
}
pq->head = NULL;
pq->tail = NULL;
}
void QueuePush(Queue* pq, QDataType data)
{
assert(pq);
if (pq->head == NULL)
{
pq->head = pq->tail = BuyQueueNode(data);
}
else
{
pq->tail->next = BuyQueueNode(data);
pq->tail = pq->tail->next;
}
}
void QueuePop(Queue* pq)
{
assert(pq);
assert(!QueueEmpty(pq));
if (pq->head->next == NULL)
{
free(pq->head);
pq->head = pq->tail = NULL;
}
else
{
QNode* next = pq->head->next;
free(pq->head);
pq->head = next;
}
}
QDataType QueueFront(Queue* pq)
{
assert(pq);
assert(!QueueEmpty(pq));
return pq->head->data;
}
QDataType QueueBack(Queue* pq)
{
assert(pq);
assert(!QueueEmpty(pq));
return pq->tail->data;
}
int QueueSize(Queue* pq)
{
assert(pq);
int size = 0;
QNode* cur = pq->head;
while (cur)
{
size++;
cur = cur->next;
}
return size;
}
bool QueueEmpty(Queue* pq)
{
assert(pq);
return pq->head == NULL;
}
二叉树的一些题目
单值二叉树 链接
如果二叉树每个节点都具有相同的值,那么该二叉树就是单值二叉树。
只有给定的树是单值二叉树时,才返回 true;否则返回 false。
void PreOrderCompare(struct TreeNode* root, int val)
{
if(root == NULL || flag == false)
{
return;
}
if(root->val != val)
{
flag = false;
return;
}
PreOrderCompare(root->left, val);
PreOrderCompare(root->right, val);
}
bool isUnivalTree(struct TreeNode* root){
if(root == NULL)
{
return true;
}
flag = true;
PreOrderCompare(root,root->val);
return flag;
}
bool isUnivalTree(TreeNode* root) {
if(root == NULL)
return true;
if((root->left && root->left->val != root->val) || (root->right && root->right->val != root->val))
return false;
return isUnivalTree(root->left) && isUnivalTree(root->right);
}
相同的树 链接
给你两棵二叉树的根节点 p 和 q ,编写一个函数来检验这两棵树是否相同。
如果两个树在结构上相同,并且节点具有相同的值,则认为它们是相同的。
相同的树:比较两棵树是否相同
特殊判断:如果两棵树都是空树那么必然相同;如果两棵树其中只有一棵树为空树那么必不相同
返回值:两棵树都非空+根节点值相同+左子树相同+右子树相同
bool isSameTree(struct TreeNode* p, struct TreeNode* q){
if(p == NULL && q == NULL)
{
return true;
}
if(p == NULL || q == NULL)
{
return false;
}
if(p->val != q->val)
{
return false;
}
return isSameTree(p->left,q->left) && isSameTree(p->right,q->right);
}
翻转二叉树链接
将一棵二叉树镜像翻转
特殊判断:空树的镜像翻转树仍然是本身
思路:翻转左子树后替换右子树,翻转右子树后替换左子树
TreeNode*invertTree(TreeNode*root)
{
if (!root)
return nullptr;
TreeNode*left = invertTree(root->left);
TreeNode*right = invertTree(root->right);
root->left = right;
root->right = left;
return root;
}
int height(TreeNode*root)
{
if (root == NULL)
return 0;
else
return max(height(root->left), height(root->right)) + 1;
}
bool isBalanced(TreeNode* root) {
if(root == NULL)
return true;
if(abs(height(root->left) - height(root->right)) > 1)
return false;
return isBalanced(root->left) && isBalanced(root->right);
}
bool isSameTree(TreeNode*p, TreeNode*q)
{
if (!p && !q)
return true;
return p && q && p->val == q->val && (isSameTree(p->left, q->left)) && (isSameTree(p->right, q->right));
}
对称的树 链接
给你一个二叉树的根节点 root , 检查它是否轴对称。
bool isSameTree(struct TreeNode* p, struct TreeNode* q){
if(p == NULL && q == NULL)
{
return true;
}
if(p == NULL || q == NULL)
{
return false;
}
if(p->val != q->val)
{
return false;
}
return isSameTree(p->left,q->right) && isSameTree(p->right,q->left);
}
bool isSymmetric(struct TreeNode* root){
if(root == NULL)
{
return true;
}
return isSameTree(root->left, root->right);
}
合并二叉树链接
TreeNode* mergeTrees(TreeNode* root1, TreeNode* root2) {
if(root1 == NULL)
return root2;
if(root2 == NULL)
return root1;
root1->val = root1->val + root2->val;
root1->left = mergeTrees(root1->left, root2->left);
root1->right = mergeTrees(root1->right, root2->right);
return root1;
}
另一棵树的子树 链接
给你两棵二叉树 root 和 subRoot 。检验 root 中是否包含和 subRoot 具有相同结构和节点值的子树。如果存在,返回 true ;否则,返回 false 。
二叉树 tree 的一棵子树包括 tree 的某个节点和这个节点的所有后代节点。tree 也可以看做它自身的一棵子树。
方式一(推荐方式二)
(方式二)
bool IsSameTree(struct TreeNode* root, struct TreeNode* subRoot)
{
if(root == NULL && subRoot == NULL)
{
return true;
}
if(root == NULL || subRoot == NULL)
{
return false;
}
if(root->val != subRoot->val)
{
return false;
}
return IsSameTree(root->left, subRoot->left) && IsSameTree(root->right, subRoot->right);
}
bool isSubtree(struct TreeNode* root, struct TreeNode* subRoot){
if(root == NULL)
{
return false;
}
if(IsSameTree(root,subRoot))
{
return true;
}
return isSubtree(root->left, subRoot) || isSubtree(root->right, subRoot);
}
I/O型的创建二叉树 链接
编一个程序,读入用户输入的一串先序遍历字符串,根据此字符串建立一个二叉树(以指针方式存储)。 例如如下的先序遍历字符串: ABC##DE#G##F### 其
中“#”表示的是空格,空格字符代表空树。建立起此二叉树以后,再对二叉树进行中序遍历,输出遍历结果。
#include<stdio.h>
#include<stdlib.h>
#include<assert.h>
typedef char BTDataType;
typedef struct BinaryTreeNode
{
BTDataType data;
struct BinaryTreeNode* left;
struct BinaryTreeNode* right;
}BTNode;
BTNode* BuyNode(BTDataType data)
{
BTNode* node = (BTNode*)malloc(sizeof(BTNode));
assert(node);
node->data = data;
node->left = NULL;
node->right = NULL;
return node;
}
BTNode* BinaryTreeCreat(BTDataType* a, int* pi)
{
if(a[*pi] == '#')
{
(*pi)++;
return NULL;
}
BTNode* node = BuyNode(a[(*pi)++]);
node->left = BinaryTreeCreat(a, pi);
node->right = BinaryTreeCreat(a, pi);
return node;
}
void PostOrder(BTNode* root)
{
if(root == NULL)
{
return;
}
PostOrder(root->left);
printf("%c ",root->data);
PostOrder(root->right);
}
void DistroyNode(BTNode* root)
{
if(root == NULL)
{
return;
}
DistroyNode(root->left);
DistroyNode(root->right);
free(root);
}
int main()
{
BTDataType a[100];
scanf("%s",a);
int pi = 0;
BTNode* node = BinaryTreeCreat(a,&pi);
PostOrder(node);
DistroyNode(node);
return 0;
}