standby list

[unoho]

So we are doing this assignment in class and one of the question is like implement a hybrid data structure for storing information about passengers waiting for a stand-by seat on a flight.
and they call it "stand-by list".

basically we take a queue and BST(binary search tree) and combine them to get a stand-by list..somehow..

so i was wondering if any of you good fellas ever heard about this..if so could you please post a picture on how this may look like? this is soo vague (to me, of course) and i cant imagine how it would look like.

[Tony]

would it be anything like http://en.wikipedia.org/wiki/Priority_queue ?

[unoho]

oh no..we already did a priority queue assignment...in fact that was our last assignment..its really hard to describe what a stand-by list is..

i hate these hybrid data structures

[OneOffDriveByPoster]

unoho @ Thu Mar 10, 2011 12:18 am wrote:

basically we take a queue and BST(binary search tree) and combine them to get a stand-by list..somehow..

So what operations are supposed to be available and which ones are supposed to be more efficient? What was the backing data structure you used for the priority queue in the last assignment?

[unoho]

so ya i kinda figured it out..but thanks anyways..