Need some interesting Advanced Data structure problems.

[reshma.mane]

Hi All,

I want some interesting Advanced data structures problems. Could you please let me know the link or the actual problem statements? If possible, you can send some hints to solve that problem. This would be very helpful for me.

[iamthwee]

Write your own stack.
Write your own queue.

Create an infix to postfix evaluator

[Alex Edwards]

Try creating a Red-Black Tree.

See attached.

[ArkM]

What data structures you consider Advanced?
Try to implement a very fast (and huge) priority queue with erase by key operation...

[reshma.mane]

Alex,
Could you tell me what is the use of Red-Black Tree. Actually I am supposed to give session on DS and to make it interactive I want it to be like problem discussion.

[Alex Edwards]

Alex, Could you tell me what is the use of Red-Black Tree. Actually I am supposed to give session on DS and to make it interactive I want it to be like problem discussion.

Narue explains it best here .