A lot of data structures related programs related to only trees and graphs, like the diameter of a tree, removing the loops in a graph etc.
No Answer is Posted For this Question
Be the First to Post Answer
Give a good data structure for having n queues ( n not fixed) in a finite memory segment. You can have some data-structure separate for each queue. Try to use at least 90% of the memory space.
How to fill element (initialize at once) in an array?
What are the properties of an algorithm?
Is null allowed in list?
Where is data structure used?
What does the dummy header in the linked list contain?
What is the advantage of circular linked list?
What is the use of bubble sort?
What are the advantages of selecetion sort?
Which collection class is thread safe?
What are the drawbacks of array implementation of queue?
what is Linked lists?