There
are many different types of data structures that you can use depending on the
application. The following are a few of
the more popular ones with their advantages and disadvantages.
Linked
List: This is one of the most common data structures. Essentially, linked lists
are kind of like arrays in the sense that you have an ordered set of data
elements. What’s different? Well, each element has link to its successor and
sometimes its predecessor. Use this data structure if you want quick inserts
and deletes. One negative aspect of using this structure is slow searches.
There
are so many more data structures: Stack, Queue, Binary Tree, Red-Black Tree,
Heap, Graph and the list goes on. I recommend that you become familiar with all
of them since knowing them will give you a good idea of what data structure is
best for your application. Data structrue questions also come up A LOT in interview questions. In my opinion, one of the best books to learn and
understand data structures is Introduction to Algorithms by Cormen, Leiserson, Rivest, and Stein. Another alternative
book is Data Structures and Algorithm Analysis in Java by Mark A. Weiss.
Other Works
Cited
Cormen, Thomas H. Introduction
to Algorithms. Cambridge, MA: MIT, 2009. Print.
Quora.
"How Do I Strengthen My Knowledge Of Data Structures And Algorithms?" Forbes.
Forbes Magazine, 03 July 2013. Web. 02 Nov. 2013.
<http://www.forbes.com/sites/quora/2013/07/03/how-do-i-strengthen-my-knowledge-of-data-structures-and-algorithms/>.
Rouse,
Margaret. "Data Structure." SearchSQLServer. N.p., Feb.
2006. Web. 02 Nov. 2013.
<http://searchsqlserver.techtarget.com/definition/data-structure>.

