Trees And Recursion

3 problems in this category

Tree DFS Recursion BFS Queue

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 →

Binary Tree Level Order Traversal

Return the level order traversal of a binary tree.

Medium LeetCode

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

View Solution →

← Back to All Categories