project in data structure in c++...

[Anirudh Kala]

hi there i am anirudh kala i am working on the project of search
engines in c++
but due to an immediate reqirement in need to develop a proj . in data
structure only..
majorly using the trees . i need a good amt of time in thinking of an
idea of creating such a proj...so is there any one who can help me
with the idea of a proj in data structure (c++)...
i know the group is not meant for these kind of assistances but this
is an urgent requirement of mine ...

[Victor Bazarov]

Anirudh Kala wrote:

hi there i am anirudh kala i am working on the project of search
engines in c++
but due to an immediate reqirement in need to develop a proj . in data
structure only..
majorly using the trees . i need a good amt of time in thinking of an
idea of creating such a proj...so is there any one who can help me
with the idea of a proj in data structure (c++)...
i know the group is not meant for these kind of assistances but this
is an urgent requirement of mine ...

I have hard time understanding with what exactly you need our help.
How can someone help "with the idea"? And if you need "a good amt"
(amount?) of time "in thinking" and also "to develop a proj" (project?)
do you expect somebody to do the developing while you do the thinking
or what?

V
--
Please remove capital 'A's when replying by e-mail
I do not respond to top-posted replies, please don't ask

[Kai-Uwe Bux]

Anirudh Kala wrote:

hi there i am anirudh kala i am working on the project of search
engines in c++
but due to an immediate reqirement in need to develop a proj . in data
structure only..
majorly using the trees . i need a good amt of time in thinking of an
idea of creating such a proj...so is there any one who can help me
with the idea of a proj in data structure (c++)...
i know the group is not meant for these kind of assistances but this
is an urgent requirement of mine ...

What about a splay-tree based replacement for std::set<>?

Or, what about a sequence container along the lines of std::vector<and
std::deque<but with intermediate performance guarantees: insert, erase,
and operator[] are all O(log(size)).
Best

Kai-Uwe Bux