Constructing spanning trees of a graph has various applications such as building a communication network over which the messages can be transferred efficiently. In this chapter, we review basic distributed tree building procedures which are general spanning tree, breadth-first-searchTrees tree and depth-first-search tree algorithms and provide their implementations in Python using mpi4py.