gistfile1.txt

Red/Black Tree implementation in GO

1- Write the tree.Add(int) function
2- Write a red black tree validator
  - check if root is black
  - check if the number of black nodes from the root to every nil is the same
  - check that there are no two consecutive red nodes
3- Write the tree.Contains(int) function

func PrintTree(node *Node) {
  if node == nil {
    fmt.Print("nil ")
    return
  }
  fmt.Print("(")
  fmt.Print(node.value)
  fmt.Print(" ")
  PrintTree(node.left)
  PrintTree(node.right)
  fmt.Print(")")
  fmt.Print(" ")


}