Recursion

2 problems using this pattern

About this pattern:

Solve problems by breaking them down into smaller instances of the same problem.

Often used with: DFS Tree

Complexity Range

Time Complexity


                  O(n)

(2 problems)

Space Complexity


                  O(h)

(2 problems)

Problems Using Recursion

Maximum Depth of Binary Tree

Return the maximum depth of the binary tree.

Example: [3,9,20,null,null,15,7] → 3

Tree DFS Recursion

View Solution →

Same Tree

Check if two binary trees are the same.

Example: p = [1,2,3], q = [1,2,3] → true

Tree DFS Recursion

View Solution →

← Back to All Patterns

View All Categories