Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include<malloc.h>
- using namespace std;
- struct node
- {
- int data;
- node *link;
- };
- node *insertFront(node *head) //node head dibuat di main
- {
- node* newNode = new node; //node *newNode=(node*)malloc(sizeof(node));
- newNode->link = head; //Node baru di link ke node yang ada di head (newNode linknya nunjuk ke kanannya)
- head->link = NULL; //head ditunjuk ke null dulu
- cin>>newNode->data; //cin data baru
- head=newNode; //Current node = head; head nunjuk ke data paling kiri, yang abis diinput
- return head;
- }
- int main()
- {
- node *head=(node*)malloc(sizeof(node));
- node *traverse=head;
- node *newData = insertFront(head);
- cout<<newData->data; //cout data yang baru
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement