Struktur data – Contoh Program Binary tree [preorder, inorder, postorder]

Langsung aja berikut tampilan output dari programnya:
dengan procedure preorder, inorder, postorder dalam binary tree.


Berikut Scriptya:
#include<stdio.h>

typedef struct node{
char data;
node *left;
node *right;
};
node *root=NULL;

void Tambahnode(node **root, char isi) {
if((*root)==NULL){
node *baru;
baru= new node;
baru->data = isi;
baru->left = NULL;
baru->right = NULL;
(*root)=baru;
}
}

void preorder(node *root) {
if(root !=NULL) {
printf(“%c “, root->data);
preorder(root->left);
preorder(root->right);
}
}

void inorder(node *root) {
if(root !=NULL) {
inorder(root->left);
printf(“%c “, root->data);
inorder(root->right);
}
}

void postorder(node *root) {
if(root !=NULL) {
postorder(root->left);
postorder(root->right);
printf(“%c “, root->data);
}
}

main()
{

char kata;
printf(“Program By: AH. HANDOYO[1412110156]\n\n”);
Tambahnode(&root,kata=’R’);
Tambahnode(&root->left,kata=’A’);
Tambahnode(&root->left->left,kata=’S’);
Tambahnode(&root->left->left->left,kata=’I’);
Tambahnode(&root->left->left->right,kata=’T’);
Tambahnode(&root->right,kata=’E’);
printf(“Tampilan secara PreOrder : “);
preorder(root);
printf(“\nTampilan secara InOrder : “);
inorder(root);
printf(“\nTampilan secara PostOrder : “);
postorder(root);
}