Let's Learn Algorithms - Graph Theory - Representing Trees in Go Code

Learn how to take a binary tree and represent it in your Go code so that you can properly start writing DFS and BFS algorithms. You will also learn how to write a parser to read an input file describing a tree so that you can test the code we write in this series with various input files. See https://play.golang.org/p/e96-kU4uPb for the completed code from this video, and check out https://www.calhoun.io to join my mailing list and get notified when I release new videos and articles like this one.