Recursive generic types in Typescript - Cheat Sheet & Quick Revision

Recall & Review

beginner

What is a recursive generic type in TypeScript?

A recursive generic type is a type that refers to itself within its own definition, allowing you to model nested or hierarchical data structures like trees or linked lists.

beginner

How does a recursive generic type help in representing tree-like data?

It allows each node to have children of the same type, enabling the structure to nest indefinitely, like branches in a tree.

intermediate

Example: What does this TypeScript type represent? <br>

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

It represents a value that can be either a single item of type T or an array of NestedArray<T>, allowing for deeply nested arrays of T.

intermediate

Why must recursive generic types be carefully designed?

Because if not designed properly, they can cause infinite recursion in type checking or make code hard to understand and maintain.

beginner

How do recursive generic types relate to real-life examples?

They are like Russian nesting dolls or family trees, where each item contains smaller items of the same kind inside it.

What does a recursive generic type allow you to do in TypeScript?

A Define types that refer to themselves

B Create functions that call themselves

C Use generics without specifying type parameters

D Avoid using generics altogether

Recursive generic types let you define types that include themselves in their definition, useful for nested structures.

Which of these is an example of a recursive generic type?

A type Number = number

B type StringArray = string[]

C type Tree<T> = { value: T; children: Tree<T>[] }

D type Pair<T> = [T, T]

The Tree type refers to itself inside its definition, making it recursive.

What problem can arise if recursive generic types are not designed carefully?

A Infinite recursion in type checking

B Syntax errors in JavaScript runtime

C Memory leaks in the browser

D Faster code execution

Improper recursive types can cause the compiler to loop infinitely while checking types.

In the type type Nested<T> = T | Nested<T>[];, what does this type represent?

A A function returning type T

B Only arrays of type T

C Only single values of type T

D A value of type T or an array of nested values

It allows either a single T or an array of Nested, enabling deep nesting.

Which real-life example best illustrates recursive generic types?

A A single book on a shelf

B A family tree with parents and children

C A flat list of names

D A calculator performing addition

A family tree is hierarchical and recursive, like recursive generic types.

Explain what recursive generic types are and give a simple example.

Think about types that include themselves inside their definition.

Describe a real-world situation where recursive generic types would be helpful and why.

Consider things like trees, folders, or nested lists.