目录
1.通过(前驱)遍历的数组构建二叉树
typedef char BTDataType;
typedef struct BinaryTreeNode
{
struct BinaryTreeNode* left;
struct BinaryTreeNode* right;
BTDataType data;
}BTNode;
BTNode* CreateTree(char* a, int* pi)//应该传指针控制数组下标
{
if(a[*pi]=='#')//假设数组内容为'#',即表示NULL
{
(*pi)++;
return NULL;
}
BTNode* root = (BTNode*)malloc(sizeof(BTNode));//构造一个结点
assert(root);
root->data = a[(*pi)++];//对该结点赋值
root->left = CreateTree(a, pi);//前驱遍历,递归实现
root->right = CreateTree(a, pi);
return root;
}
int main()
{
char a[100];
scanf("%s", a);
int i = 0;
BTNode* tree = CreateTree(a, &i);
return 0;
}
2.二叉树的三种遍历
1.前驱遍历
前序遍历(Preorder Traversal 亦称先序遍历)——访问根结点的操作发生在遍历其左右子树之前。
void PreOrder(BTNode* root)
{
if (root == NULL)
{
return;
}
printf("%c", root->data);
PreOrder(root->left);
PreOrder(root->right);
}
前序遍历结果:1 2 3 NULL NULL NULL 4 5 NULL NULL 6 NULL NULL
2.中序遍历
中序遍历(Inorder Traversal)——访问根结点的操作发生在遍历其左右子树之中(间)。
void InOrder(BTNode* root)
{
if (root == NULL)
{
return;
}
InOrder(root->left);
printf("%c", root->data);
InOrder(root->right);
}
中序遍历结果:3 2 1 5 4 6
3.后序遍历
后序遍历(Postorder Traversal)——访问根结点的操作发生在遍历其左右子树之后。
void PostOrder(BTNode* root)
{
if (root == NULL)
{
return;
}
PostOrder(root->left);
PostOrder(root->right);
printf("%c", root->data);
}
后序遍历结果:3 1 5 6 4 1
3.基础题型
1.求二叉树节点个数
int BinaryTreeSize(BTNode* root)
{
if (root == NULL)
{
return 0;
}
return 1 + BinaryTreeSize(root->left) + BinaryTreeSize(root->right);
}
2.求二叉数叶子节点个数
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);
}
3.求二叉树第k层节点个数
int BinaryTreeLevelKSize(BTNode* root, int k)
{
if (root == NULL)
{
return 0;
}
if (k == 1)
{
return 1;
}
return BinaryTreeLevelKSize(root->left, k - 1)
+ BinaryTreeLevelKSize(root->right, k - 1);
}
4.求二叉树的深度
int BTreeDepth(BTNode* root)
{
if (root == NULL)
{
return 0;
}
int leftDetpth= BTreeDepth(root->left);
int rightDepth = BTreeDepth(root->right);
return leftDetpth > rightDepth ? leftDetpth + 1 : rightDepth + 1;
}
5.二叉树查找值为x的节点
BTNode* BTreeFind(BTNode* root, BTDataType x)
{
if (root == NULL)
return NULL;
if (root->data == x)
return root;
BTNode* ret1 = BTreeFind(root->left, x);
if (ret1)
return ret1;
BTNode* ret2 = BTreeFind(root->right, x);
if (ret2)
return ret2;
return NULL;
}
结果:
int main()
{
char a[100];//pgkm##n###l#jmN##f###
scanf("%s", a);
int i = 0;
BTNode* tree = CreateTree(a, &i);
printf("节点个数为:%d\n", BinaryTreeSize(tree));
printf("叶子节点个数为:%d\n", BinaryTreeLeafSize(tree));
printf("第k层叶子节点个数为%d\n", BinaryTreeLevelKSize(tree,4));
printf("二叉树的深度为%d\n", BTreeDepth(tree));
printf("二叉树中节点值为N的节点是:%c %p", BTreeFind(tree,'N')->data,
BTreeFind(tree, 'N'));
return 0;
}