Traverse the tree using in-order traversal
(t *Tree)
| 102 | |
| 103 | //Traverse the tree using in-order traversal |
| 104 | func InOrderTraverse(t *Tree) { |
| 105 | if t == nil { |
| 106 | return |
| 107 | } |
| 108 | InOrderTraverse(t.Left) |
| 109 | fmt.Print(t.Value, " ") |
| 110 | InOrderTraverse(t.Right) |
| 111 | } |
| 112 | |
| 113 | //Height gives the height of the BST |
| 114 | func Height(t *Tree) float64 { |