Homework for course Algorithms and structures. It contains an implementation of an n-tree, with basic operations to modify it, including an operation that calculates the width of the tree with preorder. The other file contains usage of the implemented tree structure to generate a game tree for a simple game that's called Connect-Four(https://en.wikipedia.org/wiki/Connect_Four), but with a slight modification so it can be called Connect-Three (as stated in the assignment) :)