What is the best data-structure for storing elements which will be retrieved only once and then dele

Posted by Jay on Stack Overflow See other posts from Stack Overflow or by Jay
Published on 2010-06-07T14:14:22Z Indexed on 2010/06/07 14:32 UTC
Read the original article Hit count: 185

Filed under:

c

|

data-structures

I want to design a data-structure for storing elements, which will be retrieved only once after insertion and will be deleted after that.

I can't use a stack or queue as the order of retrieval is not guaranteed.

[EDIT] - I would like to use contigous memory (I would prefer to avoid doing malloc every now and then) and also I would prefer searchability also.

Related posts about data-structures

Clever ways of implementing different data structures in C & data structures that should be used mor

as seen on Stack Overflow - Search for 'Stack Overflow'
What are some clever (not ordinary) ways of implementing data structures in C, and what are some data structures that should be used more often? For example, what is the most effective way (generating minimal overhead) to implement a directed and cyclic graph with weighted edges in C? I know that… >>> More
Is there a way to track data structure dependencies from the database, through the tiers, all the way out to a web page?

as seen on Programmers - Search for 'Programmers'
When we design applications, we generally end up with the same tiered sets of data structures: A persistent data structure that is described using DDL and implemented as RDBMS tables and columns. A set of domain objects that consist primarily of data structures, usually combined with business-rule… >>> More
Why are data structures so important in interviews?

as seen on Programmers - Search for 'Programmers'
I am a newbie into the corporate world recently graduated in computers. I am a java/groovy developer. I am a quick learner and I can learn new frameworks, APIs or even programming languages within considerably short amount of time. Albeit that, I must confess that I was not so strong in data structures… >>> More
Thread-safe data structures

as seen on Stack Overflow - Search for 'Stack Overflow'
Hello, I have to design a data structure that is to be used in a multi-threaded environment. The basic API is simple: insert element, remove element, retrieve element, check that element exists. The structure's implementation uses implicit locking to guarantee the atomicity of a single API call.… >>> More
Data Structures

as seen on Stack Overflow - Search for 'Stack Overflow'
There is a large stream of numbers coming in such as 5 6 7 2 3 1 2 3 .. What kind of data structure is suitable for this problem given the constraints that elements must be inserted in descending order and duplicates should be eliminated. I am not looking for any code just ideas? I was thinking… >>> More

Developer IT

What is the best data-structure for storing elements which will be retrieved only once and then dele - Developer IT

What is the best data-structure for storing elements which will be retrieved only once and then dele

c

data-structures

Related posts about c

Related posts about data-structures

Clever ways of implementing different data structures in C & data structures that should be used mor

Is there a way to track data structure dependencies from the database, through the tiers, all the way out to a web page?

Why are data structures so important in interviews?

Thread-safe data structures

Data Structures

Categories cloud