In reply to dave_59:
Thanks Dave for your reply.
I agree queues are less efficient because of additional pointers. But resizing dynamic array by 1 element would lead to moving/copying the complete array content with each access which I am not sure is a good idea to do.
Instead it could be resized (may be add few elements at one go or double the exisiting array size everytime it reaches its max limit) might be better way to reduce frequent reallocation. What do you think?