二叉树的链表实现

最新推荐文章于 2024-08-07 17:24:39 发布

原创最新推荐文章于 2024-08-07 17:24:39 发布 · 202 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#tree #null #struct #insert #include #input

本文介绍了如何使用C语言创建一个二叉搜索树，并通过递归方式遍历其左右子树的数据。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include <stdio.h>
#include <stdlib.h>
struct tree
{
   struct tree *left;
   int data;
   struct tree *right;
};
typedef struct tree treenode;
typedef treenode *b_tree;

b_tree insert_node(b_tree root, int node)
{
   b_tree newnode,currentnode,parentnode;
   newnode = (b_tree)malloc(sizeof(treenode));
   newnode->data = node;
   newnode->left = NULL;
   newnode->right = NULL;
   if(root == NULL)
   {
       return newnode;
   }
   else
   {
       currentnode = root;
       while(currentnode != NULL)
       {
           parentnode = currentnode;
           if(currentnode->data > node)
           {
               currentnode = currentnode->left;
           }
           else
           {
               currentnode = currentnode->right;
           }
       }
       if(parentnode->data > node)
       {
           parentnode->left = newnode;
       }
       else
       {
           parentnode->right = newnode;
       }
   }
   return root;
}

b_tree creat_tree(int *data, int len)
{
   b_tree root = NULL;
   int i = 0;
   for(i = 0; i < len; i++)
   {
       root = insert_node(root,data[i]);
   }
   return root;
}

void print_tree(b_tree root)
{
   b_tree p;
   p = root->left;
   printf("Print left_tree data\n ");
   while(p != NULL)
   {
       printf("%5d",p->data);
       printf("\n");
       p = p->left;
   }
   p = root->right;
   printf("Print right_tree data\n");
   while(p != NULL)
   {
       printf("%5d",p->data);
       printf("\n");
       p = p->right;
   }
}
int main(void)
{
   b_tree root = NULL;
   int i = 0, len = 0;
   int data;
   int nodelist[20];
   printf("Please input the element of tree\n");
   scanf("%d",&data);
   while(i != 5)
   {
       nodelist[len] = data;
       len = len +1;
       scanf("%d",&data);
       i++;
   }
   root = creat_tree(nodelist,len);
   print_tree(root);
   return 0;
}