Implementation of a binary tree in Go. A Binary Tree is a tree data structure in which each node has at most two children, which are referred to as the left child and the right child. A node with no children is called a leaf node. A node cannot have more than two children.

This is a simple implementation of a stack using a linked-list in Go. (Data Structure and Algorithms)

A lightweight save converter for NDS and DeSmuME.

pp

Implentation of a general tree in Go Programming Language. A general tree is a tree data structure in which each node can have an arbitrary number of children. We are storing children in an array.

This is a simple Go program that converts a general tree to a binary tree.

Personal notes on data structures implementation using go.

This is a simple Go program that traverses a tree in different ways. (Pre-order, In-order, Post-order, and Level-order)

This is a simple implementation of a queue using a linked-list in Go. This is a good example of how to use a linked-list in Go.

This is a simple Go program that checks if a given tree is complete or not. A tree is complete if all levels are completely filled except possibly the last level and the last level has all keys as left as possible.

Sparse-Matrix Linked-List Go is a sparse matrix implementation in Go using a linked list. This is a data structure that stores only non-zero values in a matrix. This is useful when you have a lot of zeros in your matrix. This data structure is also useful when you want to perform operations on sparse matrices.

A Raspberry pi distribution to simply connect your Nintendo DS/Wii back to the internet.