Data-structures quiz

Test your Data-structures knowledge with a free interactive quiz — 50 questions with answers and explanations. No signup needed to play.

What defines a binary tree?

1. What defines a binary tree?
2. A stack is a:
3. A static array differs from a dynamic array in that:
4. What does Big O notation describe?
5. What is recursion?
6. What is the difference between "depth" and "height" in a tree?
7. A weighted graph differs from an unweighted graph in that:
8. A Set (e.g. `Set` in JS, `set` in Python) primarily supports:
9. What is a "hash collision"?
10. What is the typical time complexity of `Array.prototype.push` (or appending to a dynamic array) versus `Array.prototype.shift` (removing from the front)?
11. What does a doubly linked list have that a singly linked list does not?
12. What is the average-case time complexity of `get` and `set` in a hash table with a good hash function and reasonable load factor?

More quizzes