Algebraic Binary tree implementation in Swift

algebraicBinaryTree.swift

import Foundation

indirect enum Tree<T> {
    case empty
    case node(_ value: T, _ left: Tree<T>, _ right: Tree<T>)
}

extension Tree: CustomStringConvertible where T: CustomStringConvertible {
    var description: String {
        switch self {
        case .empty:
            return "empty"
        case let .node(v, left, right):
            return "node(\(v), \(left.description), \(right.description))"
        }
    }
}

let tree = Tree.node(42,
                     .node(0, .empty, .empty),
                     .empty)

print(tree)   // node(42, node(0, empty, empty), empty)