数据结构-二叉树

最新推荐文章于 2024-09-19 09:21:30 发布

哥兜兜里有泡泡糖

最新推荐文章于 2024-09-19 09:21:30 发布

阅读量112

点赞数

文章标签：数据结构二叉树 java jquery 算法

本文链接：https://blog.csdn.net/weixin_44512194/article/details/107150839

版权

#include <stdio.h>
#include <stdlib.h>

//二叉链节点类型
typedef struct Node
{
    int data;
    struct Node* Lchild, * Rchild;
}TreeNode;

//初始
void treeNodeInit(int level, TreeNode* treeNode)
{
    if (level > 0)
    {
        treeNode->Lchild = (TreeNode*)malloc(sizeof(TreeNode));
        treeNode->Lchild->data = level;
        treeNode->Lchild->Lchild = NULL;
        treeNode->Lchild->Rchild = NULL;
        treeNode->Rchild = (TreeNode*)malloc(sizeof(TreeNode));
        treeNode->Rchild->data = level;
        treeNode->Rchild->Lchild = NULL;
        treeNode->Rchild->Rchild = NULL;
        treeNodeInit(level - 1, treeNode->Lchild);
        treeNodeInit(level - 1, treeNode->Rchild);
    }
}

void displayTreeNode(TreeNode* treeNode)
{
    if (treeNode != NULL)
    {
        printf("%d  ", treeNode->data);
        displayTreeNode(treeNode->Lchild);
        displayTreeNode(treeNode->Rchild);
    }
}

//递归求二叉链和
int sumTreeNode(TreeNode* treeNode)
{
    if (treeNode->Lchild == NULL && treeNode->Rchild == NULL)
    {
        return treeNode->data;
    }
    else
    {
        return sumTreeNode(treeNode->Lchild) + sumTreeNode(treeNode->Rchild) + treeNode->data;
    }
}

int main()
{
    TreeNode* treeNode = (TreeNode*)malloc(sizeof(TreeNode));
    treeNode->data = 3;
    treeNode->Lchild = NULL;
    treeNode->Rchild = NULL;
    treeNodeInit(2, treeNode);
    displayTreeNode(treeNode);
    int total = sumTreeNode(treeNode);
    printf("\n%d \n", total);
    return 0;
}