Member Avatar for 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.

  • 4 Contributors
  • 5 Replies
  • 97 Views
  • 22 Hours Discussion Span
  • Latest Post Latest Post by Alex Edwards

Recommended Answers

All 5 Replies

Member Avatar for iamthwee

Write your own stack.
Write your own queue.

Create an infix to postfix evaluator

Member Avatar for Alex Edwards

Try creating a Red-Black Tree.

See attached.

Red-Black_Tree.PNG 141.88 KB
Member Avatar for ArkM

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

Member Avatar for 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.

Member Avatar for 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.

Be a part of the DaniWeb community

We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.