Binary tree practice with Go

binaryTree.go

package main

import "fmt"
import "strconv"
import "math/rand"

func getOrdinalValue(integerInput int) string {
  ordinalValueOfInteger := strconv.Itoa(integerInput)
  switch integerInput % 10 {
    case 1:
      ordinalValueOfInteger += "st"
    case 2:
      ordinalValueOfInteger += "nd"
    case 3:
      ordinalValueOfInteger += "rd"
    default:
      ordinalValueOfInteger += "th"
  }
  return ordinalValueOfInteger 
}

type binaryTree struct {
  integerValue int
  rightBranch *binaryTree
  leftBranch *binaryTree
}

func storeIntegerToBinaryTree(node *binaryTree, integerInput int) *binaryTree{
  if node == nil {
    return &binaryTree{integerInput, nil, nil}
  }
  if integerInput <= node.integerValue {
    node.leftBranch = storeIntegerToBinaryTree(node.leftBranch, integerInput)
    return node
  }
  node.rightBranch = storeIntegerToBinaryTree(node.rightBranch, integerInput)
  return node
}

func main(){
  var sizeOfVector int
  fmt.Println("How many integers would you like to put into your new binary tree? ")
  fmt.Scanf("%d", &sizeOfVector)

  vectorWithRandomIntegerElements := make([]int, sizeOfVector)
  for i := 0; i < sizeOfVector; i++ {
    vectorWithRandomIntegerElements[i] = rand.Intn(500);
    var treeNode *binaryTree
    treeNode = storeIntegerToBinaryTree(treeNode, vectorWithRandomIntegerElements[i]) 
    fmt.Println("The", getOrdinalValue(i+1), "element is: ",
      vectorWithRandomIntegerElements[i]) 
  }
}