2 Linked Implementation Queue Void Enqueue Int X Empty Rear New Node X Front Rear Else Rea Q37082951

2. // A linked implementation of a queue void enqueue (int x) if (empty)) rear = new Node (x) ; front = rear; else rear = new Node (X) ; rear = rear. next; Show transcribed image text 2. // A linked implementation of a queue void enqueue (int x) if (empty)) rear = new Node (x) ; front = rear; else rear = new Node (X) ; rear = rear.

OR

 

OR