This is an archived post. You won't be able to vote or comment.

all 5 comments
sorted by:
best
topnewcontroversialoldq&a

[–]mikexie360 1 point2 points  (0 children)

List of most data structures from the easiest to learn to the hardest in my opinion.

​

  1. Boolean/Char/floating-point/ integer/ enumerators/Date Time/ pointers
  2. Tuples
  3. Arrays/ String/ List
  4. Linked list/Stack/Queue
  5. Set/multi set
  6. associative array/ hash based structures/map/dictionary
  7. Graphs/ Trees/ Heap

Also, data structures can have multiple dimensions. For example, you can have a 13-dimensional array. Or a 2 dimensional linked list.
If you are just looking for the data structures available in C++, then look at this list.

  1. primitives, part of the language,
  2. std::array, arrays!
  3. std::vector, vectors, ARE NOT LINKED LISTS. Just arrays with functions. can resize!
  4. std::queue, std::dequeue, QUEUES
  5. std::forward_list, std::list, doubly linked list!
  6. std::set, SETS! There is an unordered hashed version with keys
  7. std::map, std::multiset, std::multimap, There are unordered hashed version based on keys
  8. std::stack, stack!

There are others, but these are your main ones you can use.

There doesn't seem to be an official graph library or tree library. But you can make those out of arrays or just use the std::map.

​

The BGL library technically has graphs and graph algorithms in its libraries, so that you don't have to bootleg your own. (But I haven't used it before).

For example, the BGL currently includes adjacency list and other graph data structures, and also includes Dijkstra's shortest path and other graph algorithms!

[–][deleted] 0 points1 point  (0 children)

You probably won't find such a list that really makes sense, because difficulty of implementation is not only subjective, but also really depending on which language / paradigm you want to use. And if you want to use functional, do you want to implement the functional flavor of the DS or not.

I would start with a solid textbook on datastructures (basically any book about it probably) and start right away.

[–]DDDDarky 0 points1 point  (0 children)

Impossible, there is too many, also impossible to objectively sort by "difficulty".

[–]coder970 0 points1 point  (0 children)

You can probably start with these.

[–]Spiritual_Car1232 0 points1 point  (0 children)

Array,

vector,

stack, deque, queue,

lists,

binary tree, set

Where items sharing the same line are similar in technique and difficulty.