Struktur Data : Implementasi Binary Tree dalam Bahasa C

📋 Daftar Isi

Deklarasi Node

struct node
{
  int data;
  struct node *left;
  struct node *right;
};

Fungsi Membuat Node Baru

struct node* newNode(int data)
{
  struct node* node = (struct node*)malloc(sizeof(struct node));
  node->data = data;
  node->left = NULL;
  node->right = NULL;

  return(node);
}

Source Code Lengkap

#include <stdio.h>

struct node
{
  int data;
  struct node *left;
  struct node *right;
};

struct node* newNode(int data)
{
  struct node* node = (struct node*)malloc(sizeof(struct node));
  node->data = data;
  node->left = NULL;
  node->right = NULL;

  return(node);
}

int main()
{
  struct node *root = newNode(1);
  root->left = newNode(2);
  root->right = newNode =(3);
  root->left->right = newNode(4);

  return 0;
}