Posted
by Rudiger
on Stack Overflow
See other posts from Stack Overflow
or by Rudiger
Published on 2010-02-14T16:02:03Z
Indexed on
2010/03/30
22:03 UTC
Read the original article
Hit count: 479
I'm accessing the minimum element of a binary tree lots of times. What implementations allow me to access the minimum element in constant time, rather than O(log n)?
© Stack Overflow or respective owner
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
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
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
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
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
as seen on Stack Overflow
- Search for 'Stack Overflow'
Consider the following BNF defining trees of numbers.
Notice that a tree can either be a leaf, a node-1 with one subtrees, or a node-2
with two subtrees.
tree ::= (’leaf number)
| (’node-1 tree)
| (’node-2 tree tree)
a. Write a template for recursive procedures on these trees.
b. Define the procedure…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
I have a binary tree T which I would like to copy to another tree.
Suppose I have a visit method that gets evaluated at every node:
struct visit
{
virtual void operator() (node* n)=0;
};
and I have a visitor algorithm
void visitor(node* t, visit& v)
{
//do a preorder traversal using…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
Trying to create a game using priority queues and binary tree, for example a solitaire game. I hope this is not to vague?
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
I am wondering what the particular applications of binary trees are. Could you give some real examples?
Thanks.
>>> More
as seen on Programmers
- Search for 'Programmers'
This is a simple immutable deque based on binary trees. What do you think about it? Does this kind of data structure, or possibly an improvement thereof, seem useful? How could I improve it, preferably without getting rid of its strengths? (Not in the sense of more operations, in the sense of different…
>>> More
