Recursive enumerations in Swift

Introduction

Recursive enumerations let you create values that can contain other values of the same type. This helps model things like trees or nested lists easily.

When you want to represent a tree structure, like a family tree or file system.

When you need to model nested data, such as arithmetic expressions with operations inside operations.

When you want to create linked lists or other self-referential data structures.

When you want to process data that can contain smaller parts of the same kind.

Syntax

Swift

indirect enum EnumName {
    case simpleCase
    case recursiveCase(EnumName)
}

The indirect keyword tells Swift that the enum can hold values of its own type.

You can mark the whole enum as indirect or just specific cases.

Examples

This enum models arithmetic expressions that can be numbers or operations combining other expressions.

Swift

indirect enum ArithmeticExpression {
    case number(Int)
    case addition(ArithmeticExpression, ArithmeticExpression)
    case multiplication(ArithmeticExpression, ArithmeticExpression)
}

Here, only the node case is recursive, holding a value and the rest of the list.

Swift

enum LinkedList {
    case empty
    indirect case node(Int, LinkedList)
}

This enum models a simple chain that ends or points to another chain.

Swift

indirect enum SimpleRecursive {
    case end
    case next(SimpleRecursive)
}

Sample Program

This program defines a recursive enum to represent arithmetic expressions. It builds the expression (5 + 4) * 2 and evaluates it recursively.

Swift

import Foundation

indirect enum ArithmeticExpression {
    case number(Int)
    case addition(ArithmeticExpression, ArithmeticExpression)
    case multiplication(ArithmeticExpression, ArithmeticExpression)
}

func evaluate(_ expression: ArithmeticExpression) -> Int {
    switch expression {
    case .number(let value):
        return value
    case .addition(let left, let right):
        return evaluate(left) + evaluate(right)
    case .multiplication(let left, let right):
        return evaluate(left) * evaluate(right)
    }
}

// Build expression: (5 + 4) * 2
let five = ArithmeticExpression.number(5)
let four = ArithmeticExpression.number(4)
let sum = ArithmeticExpression.addition(five, four)
let two = ArithmeticExpression.number(2)
let product = ArithmeticExpression.multiplication(sum, two)

print("Expression evaluates to: \(evaluate(product))")

Important Notes

Time complexity depends on the size of the recursive structure; evaluation visits each node once, so O(n).

Space complexity is O(n) due to the call stack during recursion.

Common mistake: forgetting to mark enum or cases as indirect causes compiler errors.

Use recursive enums when data naturally nests or links to itself; for flat data, simpler types are better.

Summary

Recursive enums let you create self-referential data types.

Use indirect to tell Swift about recursion.

Great for trees, linked lists, and nested expressions.

Practice

1. What does the indirect keyword do in a Swift recursive enumeration?

easy

A. It allows the enum to refer to itself recursively.

B. It makes the enum immutable.

C. It converts the enum into a class.

D. It prevents the enum from being used in switch statements.

Solution

1. Step 1: Understand the role of indirect

   The indirect keyword tells Swift that the enum cases can hold references to the enum itself, enabling recursion.

2. Step 2: Identify what recursion means in enums

   Recursion means an enum case can contain another instance of the same enum, which requires indirect to avoid infinite size.

3. Final Answer:

   It allows the enum to refer to itself recursively. -> Option A

4. Quick Check:

   indirect enables recursion = C [OK]

Hint: Remember: indirect means self-reference allowed [OK]

Common Mistakes:

• Thinking indirect makes enum immutable
• Confusing indirect with class conversion
• Believing indirect disables switch usage

2. Which of the following is the correct syntax to declare a recursive enum case in Swift?

easy

A. enum Tree { case leaf(Int); indirect case node(Tree, Tree) }

B. enum Tree { case leaf(Int); case node(Tree, Tree) }

C. enum Tree { indirect case leaf(Int); case node(Tree, Tree) }

D. indirect enum Tree { case leaf(Int); case node(Tree, Tree) }

Solution

1. Step 1: Recall how to declare recursive enums

   Swift allows marking the whole enum as indirect to enable recursion for all cases.

2. Step 2: Check each option's syntax

   The syntax indirect enum Tree { case leaf(Int); case node(Tree, Tree) } correctly enables recursion by marking the whole enum indirect. Other options either lack the keyword, apply it only to non-recursive cases (leaving recursive case without), or contain syntax errors such as missing the case keyword.

3. Final Answer:

   indirect enum Tree { case leaf(Int); case node(Tree, Tree) } -> Option D

4. Quick Check:

   Whole enum indirect = A [OK]

Hint: Use 'indirect enum' for all recursive cases [OK]

Common Mistakes:

• Omitting indirect keyword
• Placing indirect only on some cases incorrectly
• Using indirect outside enum declaration

3. Given the recursive enum below, what is the output of print(tree.countLeaves())?

indirect enum Tree {
    case leaf(Int)
    case node(Tree, Tree)

    func countLeaves() -> Int {
        switch self {
        case .leaf(_): return 1
        case let .node(left, right):
            return left.countLeaves() + right.countLeaves()
        }
    }
}

let tree = Tree.node(.leaf(1), Tree.node(.leaf(2), .leaf(3)))

medium

A. 1

B. 2

C. 3

D. 4

Solution

1. Step 1: Understand the tree structure

   The tree is: node(leaf(1), node(leaf(2), leaf(3))). It has three leaves: 1, 2, and 3.

2. Step 2: Count leaves recursively

   The countLeaves function returns 1 for each leaf and sums counts for nodes. So total leaves = 1 + (1 + 1) = 3.

3. Final Answer:

   3 -> Option C

4. Quick Check:

   Leaves counted = 3 [OK]

Hint: Count leaf nodes recursively for total leaves [OK]

Common Mistakes:

• Counting nodes instead of leaves
• Misunderstanding recursive calls
• Forgetting to sum both sides

4. Identify the error in this recursive enum declaration:

enum List {
    case end
    case node(Int, List)
}

medium

A. Missing indirect keyword for recursion.

B. Enum cases cannot have associated values.

C. The enum must be a class to be recursive.

D. The case end should have an associated value.

Solution

1. Step 1: Check for recursion support

   The enum List has a case node(Int, List) which refers to itself, so it is recursive.

2. Step 2: Verify use of indirect

   Swift requires marking recursive enums or cases with indirect. This enum lacks it, causing a compile error.

3. Final Answer:

   Missing indirect keyword for recursion. -> Option A

4. Quick Check:

   Recursive enum needs indirect = B [OK]

Hint: Add indirect to recursive enums or cases [OK]

Common Mistakes:

• Ignoring indirect keyword requirement
• Thinking recursion needs classes
• Assuming all enum cases need associated values

5. How would you modify this recursive enum to safely calculate the depth of a tree, returning 0 for leaves and the maximum depth for nodes?

indirect enum Tree {
    case leaf(Int)
    case node(Tree, Tree)

    func depth() -> Int {
        // Your code here
    }
}

hard

A. Return 1 for leaf, and sum depths of left and right nodes.

B. Return 0 for leaf, and 1 + max depth of left and right nodes.

C. Return 0 for leaf, and sum depths of left and right nodes.

D. Return 1 for leaf, and 1 + min depth of left and right nodes.

Solution

1. Step 1: Define depth for leaf nodes

   Leaves have depth 0 because they have no children.

2. Step 2: Define depth for node cases

   Nodes have depth 1 plus the maximum depth of their two child trees.

3. Final Answer:

   Return 0 for leaf, and 1 + max depth of left and right nodes. -> Option B

4. Quick Check:

   Depth = 0 for leaf, max + 1 for node = A [OK]

Hint: Depth = 0 leaf, 1 + max child depth node [OK]

Common Mistakes:

• Using sum instead of max for node depth
• Returning 1 for leaf depth incorrectly
• Using min instead of max for node depth