Recursive generic types in Typescript

Introduction

Recursive generic types let you define types that refer to themselves. This helps describe complex, nested data like trees or linked lists in a safe way.

When you want to represent a tree structure where each node can have children of the same type.

When defining a linked list where each element points to the next element of the same type.

When modeling nested JSON objects where properties can be the same type recursively.

When creating a type-safe way to handle deeply nested data structures like menus or folders.

Syntax

Typescript

interface TreeNode<T> {
  value: T;
  children?: TreeNode<T>[];
}

The interface TreeNode refers to itself inside the children property.

This allows nesting the same type inside itself to any depth.

Examples

A linked list node points to the next node of the same type or undefined if it is the last.

Typescript

interface LinkedListNode<T> {
  value: T;
  next?: LinkedListNode<T>;
}

This type allows arrays nested inside arrays recursively.

Typescript

interface NestedArray<T> {
  value: T | NestedArray<T>[];
}

Shows a single node with no next node (end of list).

Typescript

interface EmptyNode<T> {
  value: T;
  next?: EmptyNode<T>;
}

// Edge case: single node with no next
const singleNode: EmptyNode<number> = { value: 5 };

A tree node with an empty children array means it has no children.

Typescript

interface TreeNode<T> {
  value: T;
  children?: TreeNode<T>[];
}

// Edge case: empty children array
const leafNode: TreeNode<string> = { value: "leaf", children: [] };

Sample Program

This program defines a recursive generic type TreeNode for a tree structure. It creates a tree of numbers with nested children. The printTree function prints each node's value with indentation to show the tree shape.

Typescript

interface TreeNode<T> {
  value: T;
  children?: TreeNode<T>[];
}

// Create a tree of numbers
const rootNode: TreeNode<number> = {
  value: 1,
  children: [
    { value: 2 },
    {
      value: 3,
      children: [
        { value: 4 },
        { value: 5 }
      ]
    }
  ]
};

// Function to print tree values recursively
function printTree<T>(node: TreeNode<T>, indent = "") {
  console.log(`${indent}${node.value}`);
  if (node.children) {
    for (const child of node.children) {
      printTree(child, indent + "  ");
    }
  }
}

console.log("Tree structure:");
printTree(rootNode);

Important Notes

Time complexity of traversing recursive types depends on the number of nodes (usually O(n)).

Space complexity depends on recursion depth and stored data.

Common mistake: forgetting the optional property for recursion base case, causing infinite recursion or errors.

Use recursive generic types when you need to model nested or linked data safely with TypeScript's type system.

Summary

Recursive generic types let types refer to themselves to model nested data.

They are useful for trees, linked lists, and nested structures.

Always include a base case (like optional properties) to avoid infinite recursion.

Practice

1. What is the main purpose of using recursive generic types in TypeScript?

easy

A. To create simple flat types without any nesting

B. To automatically generate UI components

C. To enforce runtime type checking

D. To define types that refer to themselves for nested or hierarchical data

Solution

1. Step 1: Understand recursive generic types

   Recursive generic types allow a type to refer to itself, which helps model nested or hierarchical data structures like trees or linked lists.

2. Step 2: Compare options

   Options A, C, and D do not describe recursive generics correctly. Only To define types that refer to themselves for nested or hierarchical data correctly states their purpose.

3. Final Answer:

   To define types that refer to themselves for nested or hierarchical data -> Option D

4. Quick Check:

   Recursive generics = self-referential types [OK]

Hint: Recursive generics model nested data by referring to themselves [OK]

Common Mistakes:

• Thinking recursive generics are for runtime checks
• Confusing recursive generics with simple generics
• Assuming recursive generics flatten data

2. Which of the following is the correct syntax to define a recursive generic type for a nested object with children of the same type?

easy

A. type Node<T> = { value: T; children: Node[] };

B. type Node<T> = { value: T; children?: Node<T>[] };

C. type Node<T> = { value: T; children: Node<T> };

D. type Node<T> = { value: T; children: T[] };

Solution

1. Step 1: Analyze recursive generic syntax

   The type should refer to itself with the generic parameter and allow children to be an array of the same type or optional to avoid infinite recursion.

2. Step 2: Check each option

   type Node<T> = { value: T; children?: Node<T>[] }; correctly defines children as optional array of Node<T>. type Node<T> = { value: T; children: Node[] }; misses generic parameter. type Node<T> = { value: T; children: Node<T> }; makes children a single Node, not array. type Node<T> = { value: T; children: T[] }; uses T[] which is incorrect.

3. Final Answer:

   type Node<T> = { value: T; children?: Node<T>[] }; -> Option B

4. Quick Check:

   Recursive generic with optional children array = type Node<T> = { value: T; children?: Node<T>[] }; [OK]

Hint: Use optional array of same generic type for recursive children [OK]

Common Mistakes:

• Omitting generic parameter in recursive reference
• Making children non-array when it should be array
• Not making children optional causing infinite recursion

3. Given the following TypeScript code, what is the type of tree.children[0].children[0].value?

type TreeNode<T> = { value: T; children?: TreeNode<T>[] };
const tree: TreeNode<string> = {
  value: "root",
  children: [
    { value: "child1", children: [{ value: "grandchild1" }] },
    { value: "child2" }
  ]
};

medium

A. string

B. TreeNode<string>

C. string | undefined

D. TreeNode<string> | undefined

Solution

1. Step 1: Understand the type definition

   TreeNode<T> has a value of type T. Here, T is string.

2. Step 2: Trace the property access

   tree.children[0].children[0].value accesses the value of a nested node, which is a string as per the generic type.

3. Final Answer:

   string -> Option A

4. Quick Check:

   Nested node value type = string [OK]

Hint: Generic type T defines value type at all levels [OK]

Common Mistakes:

• Confusing node type with value type
• Assuming children or value can be undefined here
• Mixing up generic parameter with node type

4. Identify the error in this recursive generic type definition:

type ListNode<T> = {
  value: T;
  next: ListNode<T>;
};

medium

A. 'value' should be optional

B. Generic parameter T is not used correctly

C. Missing optional property for 'next' causing infinite recursion

D. TypeScript does not support recursive types

Solution

1. Step 1: Analyze the recursive type definition

   The next property refers to ListNode<T> without being optional, so it requires an infinite chain.

2. Step 2: Identify the fix

   Making next optional (next?: ListNode<T>) provides a base case to stop recursion.

3. Final Answer:

   Missing optional property for 'next' causing infinite recursion -> Option C

4. Quick Check:

   Recursive types need optional base case [OK]

Hint: Make recursive property optional to avoid infinite recursion [OK]

Common Mistakes:

• Forgetting to add '?' to recursive property
• Thinking TypeScript disallows recursive types
• Making unrelated properties optional

5. You want to create a recursive generic type NestedArray<T> that represents an array of elements of type T or arrays of NestedArray<T> (nested arrays). Which of the following definitions correctly models this?

hard

A. type NestedArray<T> = Array;

B. type NestedArray<T> = T | NestedArray<T>[];

C. type NestedArray<T> = Array<T> | NestedArray<T>;

D. type NestedArray<T> = T[] | NestedArray<T>;

Solution

1. Step 1: Understand the nested array structure

   A nested array can be an array of elements of type T or arrays of nested arrays recursively.

2. Step 2: Evaluate each option

   type NestedArray<T> = Array; correctly defines NestedArray<T> as an array whose elements are either T or NestedArray<T>. type NestedArray<T> = T | NestedArray<T>[]; is incorrect because it allows a single element T without array wrapper. Options C and D misuse union and array placement.

3. Final Answer:

   type NestedArray<T> = Array<T | NestedArray<T>>; -> Option A

4. Quick Check:

   Nested arrays = arrays of T or nested arrays [OK]

Hint: Use array of union of T or NestedArray<T> for nested arrays [OK]

Common Mistakes:

• Allowing T alone without array wrapper
• Incorrect union placement outside array
• Confusing recursive generic with simple union