Implementation of Queue
This project explains the implementation of a QUEUE using a triangle as an element. The queue is a data structure which works on FIFO (First In First Out) technique. The triangles are inserted as elements by assigning color and side to each element(triangle). Triangles will be placed one above another by keeping first inserted triangle at the bottom and the successive elements on top of it. When Delete operation is selected using mouse button the triangle from the front end will be taken out first from the Queue.