Note 10.1.1: Linked Lists - Nodes 1

Note 10.1.2: Linked Lists - Nodes 2

Note 10.1.3: Linked Lists - Nodes 3     Example 1

Note 10.2: Inserting a Node into a Linked List

Note 10.3.1: Adding a Node onto the End of a Queue

Note 10.3.2: Pushing a Node onto the Top of a Stack

Note 10.3.3: Typical Stack Depiction

Note 10.4.1: Binary Tree 01

Note 10.4.2: Binary Tree 02 - Insertion Part A

Note 10.4.3: Binary Tree 03 - Insertion Part B

Note 10.4.4: Binary Tree 04 - inorder traversal function

Note 10.4.5: Binary Tree 05 - Search