(n, nilNode Node[T], traversal *[]T)
| 83 | } |
| 84 | |
| 85 | func preOrderRecursive[T constraints.Ordered](n, nilNode Node[T], traversal *[]T) { |
| 86 | if n == nilNode { |
| 87 | return |
| 88 | } |
| 89 | |
| 90 | *traversal = append(*traversal, n.Key()) |
| 91 | preOrderRecursive(n.Left(), nilNode, traversal) |
| 92 | preOrderRecursive(n.Right(), nilNode, traversal) |
| 93 | |
| 94 | } |
| 95 | |
| 96 | func postOrderRecursive[T constraints.Ordered](n, nilNode Node[T], traversal *[]T) { |
| 97 | if n == nilNode { |