MCPcopy Create free account
hub / github.com/Ayush7614/Daily-Coding-DS-ALGO-Practice / enqueue

Method enqueue

Data Structures/QueueUsingLL.cpp:52–63  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

50 }
51
52 void enqueue(T data) {
53 if(size==0){
54 fron->data=data;
55 rear->data=data;
56 size++;
57 return;
58 }
59 Node<T>* temp=new Node<T>(data);
60 rear->next=temp;
61 rear=temp;
62 size++;
63 }
64
65 int getSize() {
66 return size;

Callers 1

mainFunction · 0.45

Calls

no outgoing calls

Tested by

no test coverage detected