//Binary Tree – Insertion Using C – 32 PPT – Albert Hendry Harsono (1701296914) #include <stdio.h> #include <stdlib.h> struct tnode{ int value; struct tnode *left; struct tnode *right; }*leaf; void insert(int key, struct tnode **leaf){ if( *leaf == 0 ) … Continue reading →

Infix to Postfix using C – 32 PPT – Albert Hendry Harsono (1701296914) #include <stdio.h> #include <stdlib.h> #include <string.h> char op[50]; struct node { char data; struct node *next; }*head=0; void push(char x) { if(head==NULL) { head=(struct node *)malloc(sizeof(struct node)); … Continue reading →

Download: http://pastebin.com/SpCBXAhU #include<stdio.h> #include<stdlib.h> struct node { int data; struct node *prev; struct node *next; }*head, *last; void display() { struct node *temp; temp=head; while(temp!=NULL) { printf(” %d “,temp->data); temp=temp->next; } } void insertAwal() { struct node *var,*temp; var=(struct node *)malloc(sizeof(struct … Continue reading →