(n, nilNode Node[T], traversal *[]T)
| 94 | } |
| 95 | |
| 96 | func postOrderRecursive[T constraints.Ordered](n, nilNode Node[T], traversal *[]T) { |
| 97 | if n == nilNode { |
| 98 | return |
| 99 | } |
| 100 | |
| 101 | postOrderRecursive(n.Left(), nilNode, traversal) |
| 102 | postOrderRecursive(n.Right(), nilNode, traversal) |
| 103 | *traversal = append(*traversal, n.Key()) |
| 104 | } |
| 105 | |
| 106 | func calculateDepth[T constraints.Ordered](n, nilNode Node[T], depth int) int { |
| 107 | if n == nilNode { |