Problem set 03 - Basic data structures
Problems
Name | Average score | Average tries | Average tries for full score | |
---|---|---|---|---|
A | Dynamically Sized Array | 600/44 (14) | 6.29 | 6.17 |
B | Doubly Linked List | 300/9 (33) | 3.00 | 3.00 |
C | Stack | 600/19 (32) | 2.71 | 2.83 |
D | Queue | 500/30 (17) | 5.00 | 4.00 |
E | Deque | 400/9 (44) | 2.25 | 2.25 |
F | Heap | 200/2 (100) | 1.00 | 1.00 |
G | Hash Table | 100/3 (33) | 3.00 | 3.00 |
H | Self Balancing Binary Search Tree | 0/0 (0) | -- | -- |