dfsrec.go

func DF(n *Node) {
   s := Stack{}
   current := n
   for {
      if s.IsEmpty() && current == nil { return }
      if current != nil {
         s.Push(current)
         current = current.Left
      } else {
         current, _ = s.Pop()
         current.Process()
         current = current.Right
      }
   }
}