Why is std::map implemented as a red-black tree?
Why is std::map implemented as a red-black tree? There are several balanced binary search trees (BSTs) out there. What were design trade-offs in choosing a red-black tree? 6 Answers 6
data-structures
.Net Data structures: ArrayList, List, HashTable, Dictionary, SortedList, SortedDictionary — Speed, memory, and when to use each? [closed]
Closed. This question needs to be more focused. It is not currently accepting answers. Want to improve this question? Update the question so it focuses on one problem only by editing this post. Closed 11 months ago. Improve this question .NET has a lot of complex data structures. Unfortunately, some of them are quite similar … Read more
What is the best way to implement nested dictionaries?
I have a data structure which essentially amounts to a nested dictionary. Let’s say it looks like this: {‘new jersey’: {‘mercer county’: {‘plumbers’: 3, ‘programmers’: 81}, ‘middlesex county’: {‘programmers’: 81, ‘salesmen’: 62}}, ‘new york’: {‘queens county’: {‘plumbers’: 9, ‘salesmen’: 36}}} Now, maintaining and creating this is pretty painful; every time I have a new state/county/profession … Read more
Why should I use Deque over Stack?
I need a Stack data structure for my use case. I should be able to push items into the data structure and I only want to retrieve the last item from the Stack. The JavaDoc for Stack says : A more complete and consistent set of LIFO stack operations is provided by the Deque interface … Read more
Python Sets vs Lists
In Python, which data structure is more efficient/speedy? Assuming that order is not important to me and I would be checking for duplicates anyway, is a Python set slower than a Python list? 10 Answers 10
Priority queue in .Net [closed]
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers. We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations. Closed 5 years ago. Improve this question I am looking for a .NET … Read more
golang why don’t we have a set datastructure [closed]
Closed. This question is opinion-based. It is not currently accepting answers. Want to improve this question? Update the question so it can be answered with facts and citations by editing this post. Closed 6 years ago. Improve this question I’m trying to solve “The go programming lanaguage” exercise #1.4 which requires me to have a … Read more
Why doesn’t java.util.Set have get(int index)?
I’m sure there’s a good reason, but could someone please explain why the java.util.Set interface lacks get(int Index), or any similar get() method? It seems that sets are great for putting things into, but I can’t find an elegant way of retrieving a single item from it. If I know I want the first item, … Read more
What is the difference between a map and a dictionary?
I know a map is a data structure that maps keys to values. Isn’t a dictionary the same? What is the difference between a map and a dictionary1? 1. I am not asking for how they are defined in language X or Y (which seems to be what generally people are asking here on SO), … Read more
Skip List vs. Binary Search Tree
I recently came across the data structure known as a skip list. It seems to have very similar behavior to a binary search tree. Why would you ever want to use a skip list over a binary search tree? 7 Answers 7
