Is priority queue a non-linear data structure?

Linear Data Structures are lists and arrays Priority Queue is an abstract data structure (abstract means it can be implemented in terms of other data structures in multiple ways) usually implemented in terms of a heap. For performance measurement, usually the asymptotic cost of operations is used. For example, how much time does N insertion operations take?

Sorry this is an incomplete answer. A complete answer is beyond the scope of SO.

Linear Data Structures are lists and arrays. Priority Queue is an abstract data structure (abstract means it can be implemented in terms of other data structures in multiple ways) usually implemented in terms of a heap. For performance measurement, usually the asymptotic cost of operations is used.

For example, how much time does N insertion operations take? Sorry this is an incomplete answer. A complete answer is beyond the scope of SO.

It is irritating to try and answer a bunch of questions asked point-blank without a knowledge of how much effort the asker has put to try to find an answer himself. – phaedrus Mar 14 '10 at 5:50 Thanks. I agree with you.

– Maxood Mar 23 '10 at 11:50.

I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.