Introduction - If you have any usage issues, please Google them yourself
Single list, round robin list, double-linked list, circular double-linked list implementation, and implementation of a binary tree traversal. Forest conversion, and the depth and breadth of the tree graph traversal, adjacency matrix adjacency list