#include <stdio.h>
#include <assert.h>
#include <string.h>
#include <stdlib.h>
typedef char BTDataType;
typedef struct BinaryTree
{
struct BinaryTree* left;
struct BinaryTree* right;
BTDataType data;
}BTNode;
//初始化
BTNode* BTCreate(BTDataType x)
{
BTNode* node = (BTNode*)malloc(sizeof(BTNode));
if (node == NULL)
{
perror("malloc false");
exit(-1);
}
BTNode* root = node;
root->left = NULL;
root->right = NULL;
root->data = x;
return root;
}
//前序
void PrevOrder(BTNode* root)
{
if (root == NULL)
{
printf("NULL ");
return;
}
printf("%c ", root->data);
PrevOrder(root->left);
PrevOrder(root->right);
}
//中序
void InOrder(BTNode* root)
{
if (root == NULL)
{
printf("NULL ");
return;
}
PrevOrder(root->left);
printf("%c ", root->data);
PrevOrder(root->right);
}
//后序
void PoseOrder(BTNode* root)
{
if (root == NULL)
{
printf("NULL ");
return;
}
PrevOrder(root->left);
PrevOrder(root->right);
printf("%c ", root->data);
}
//1、树的结点
//void TreeSize(BTNode* root, int* sz)
//{
// if (root == NULL)
// {
// return 0;
// }
// (*sz)++;
// TreeSize(root->left, sz);
// TreeSize(root->right, sz);
//
//}
//2、树的结点
int TreeSize(BTNode* root)
{
return root == NULL ? 0 : TreeSize(root->left) + TreeSize(root->right) + 1;
}
//树的左右有几个结点
int TreeLfRt(BTNode* root)
{
if (root == NULL)
{
return 0;
}
return 1 + TreeLfRt(root->right) + TreeLfRt(root->left);
}
//树的层数
int TreeLayer(BTNode* root)
{
if (root == NULL)
{
return 0;
}
int left = TreeLayer(root->left);
int right = TreeLayer(root->right);
return left > right ? left + 1 : right + 1;
}
//每层有几个结点
int TreeLayerNode(BTNode* root, int k, int count)
{
if (k == 1)
{
return 1;
}
while (count > k-1)
{
if (root->left == NULL && root->right == NULL)
{
return 0;
}
else if (root->left != NULL && root->right != NULL)
{
return 2;
}
else if (root->left != NULL || root->right != NULL)
{
return 1;
}
}
count += 1;
return TreeLayerNode(root->left, k - 1,count) + TreeLayerNode(root->right, k - 1,count);
}
//书有几个叶子
int TreeLeafSize(BTNode* root)
{
if (root == NULL)
return 0;
if (root->left == NULL && root->right == NULL)
return 1;
return TreeLeafSize(root->left) + TreeLeafSize(root->right);
}
int main()
{
BTNode* A = BTCreate('A');
BTNode* B = BTCreate('B');
BTNode* C = BTCreate('C');
BTNode* D = BTCreate('D');
BTNode* E = BTCreate('E');
BTNode* F = BTCreate('F');
BTNode* G = BTCreate('G');
BTNode* Q = BTCreate('Q');
A->left = B;
A->right = C;
B->left = D;
B->right = Q;
C->left = E;
C->right = F;
F->right = G;
//PrevOrder(A);
//printf("\n");
//int sz = 0;
//sz = TreeLeafSize(A);
//printf("%d ", sz);
printf("%d ", TreeLayerNode(A, 3, 1));
return 0;
}
【数据结构】二叉树的实现--需要时ctrl+c
于 2022-02-02 22:47:34 首次发布