A collection of Go code for me to re-learn data structures including:
A fixed size structure with push and pop methods, following the FILO rule (first in, last out).
A fixed size structure with add and del methods, following the FIFO rule (first in, first out).
A non-fixed (only restricted by available memory) data structure with add and del methods. Each item or 'node' in the list contains a pointer to the next item in the list. Their is no first or last out rule that applies to this list as it allows the removal of any item in any order.
A non-fixed (only restricted by available memory) data structure with add and del methods. Each item or 'node' in the list contains a pointer to the next item in the list as well the previous. Their is no first or last out rule that applies to this list as it allows the removal of any item in any order.
These were originally all written in C++, feel free to check them out.
##License This tool is protected by the GNU General Public License v2.
Copyright Jeffrey Hann 2014