Method PrintReport

project_euler/problem_18/tree.go:121–157

PrintReport is a method that prints a report of the tree Node by node

()

// PrintReport is a method that prints a report of the tree
// Node by node
func (t *Tree) PrintReport() {
	t.Nodes = make(map[int]struct{})
	if t.Root == nil {
		return
	}

	queue := make([]Node, 0)
	queue = append(queue, t.Root)

	head := 0

	for head < len(queue) {
		current := queue[head]
		head++

		print("ID:", current.GetID())
		print(", Current node:", current.Value())

		if !current.LeftIsNil() {
			print(", Left Child:", current.Left().Value())

			if !t.isInQueue(current.Left().GetID()) {
				queue = append(queue, current.Left())
			}
		}

		if !current.RightIsNil() {
			print(", Right Child:", current.Right().Value())

			if !t.isInQueue(current.Right().GetID()) {
				queue = append(queue, current.Right())
			}
		}

		println()
	}
}

// PrintPyramid is a method that prints the tree as a pyramid
func (t *Tree) PrintPyramid() {