Showing 0-0 of 0 results
| # | Exercise Title | Features | Description | Platform | Keywords |
|---|---|---|---|---|---|
| 1 | List Element Data Slideshow | Algorithm Visualization | Slideshow discussing the tradeoffs for storing element values in link nodes vs. references to element values. | OpenDSA | List Element Implementation |
| 2 | List Element Deletion Slideshow | Algorithm Visualization | Slideshow discussing the design choices on what to do when a list element is deleted. | OpenDSA | List Element Implementation |
| 3 | List Element Type Slideshow | Algorithm Visualization | Slideshow illustrating the choice between storing non-homogeneous data types in list nodes and limiting to a homogenous data type. | OpenDSA | List Element Implementation |
| 4 | Linked List Implementation | In this example, we will define a linked list and create functions to add a new element to the end... | PCEX | ||
| 5 | Linked List Implementation | In this example, we will define a linked list and create functions to add a new element to the end... | PCEX | ||
| 6 | Construct a function that checks the size of a linked list |
Construct a function that calculates the number of elements in a singly linked list. LinkedList class implementation is given below. |
jsParsons | linked list | |
| 7 | Construct a function that traverse a linked list |
Construct a function that prints all elements of a Doubly Linked List in forwards and then reverse order. DoublyLinkedList class implementation... |
jsParsons | doubly linked list, linked list |