ctrl v leri alalım panpalar

konu açık ve net beler ilk ben

CcCTayfagibenziCcC

http://c.steelseries.com/dota2betakey?code=4kkvteNd

http://www.imdb.com/title/tt1636826/

Başlıyorum binler
Yeryüzünde tek bir çocuk bile acı çekiyorsa, tanrı yoktur(Dostoyevski)

(bkz: julia alexandratou karısının ferresi)

http://inciswf.com/1292972964.swf imana gel

http://www.blogtv.com/people/ercikcik

annsizinn

цензор и удаление комментариев. скоро будет здесь, на стене.

o değilde (bkz: modlar inboxumu görebilir mi)

http://inciswf.com/bucapsebakan.swf

reserved

koy gotune rahvan gitsin

http://imgim.com/12uw7.jpg

http://hotfile.com/dl/137...83a37/easymetin2.exe.html

Ne me quitte pas

valla bu varmış.. çok entelim.

#include <iostream>
1. include "linkedlist.h"
using namespace std;

class queue{
private:
linkedlist list;
node *head,*tail;
int count;
public:
queue();// constructor
void enqueue (int value);
int dequeue();
int getfront();
void display();
};

queue::queue()
{
head= null;
tail= null;
count=0;
}

void queue::enqueue(int data) {
count++;
node *n = new node;
n->data = data;
n->next = null;

if(head==null)
{
n->next=head;
head=n;
}else {
if(tail=null){
n->next=tail;
tail=n;
}
while(tail!=null) {
tail = tail->next;
}

}

}

int queue::dequeue() {
count--;
if(head=null)
cout<<"queue is empty"<<endl;
node* cur;
cur = head;
head = head->next;
return cur->data;
}

void queue::display() {

node *cur = head;
cout<<"[";
while(cur != null)
{
cout << cur->data << " ";
cur = cur->next;
}
cout<<"]";
cout << endl;

}

int queue::getfront() {

if(count==0)
{
cerr<<"queue is empty!" <<endl;
exit(1);
}
else
{
return head->data;
}

}

five little monkeys jumping on the bed
one fell off and bumped his head
so momma called the doctor and the doctor said
no more monkeys jumping on the bed!

biraz yaşlı ama gene de giber seni.