Recursion

Destcription Given the root of a binary tree, construct a string consisting of parenthesis and integ

Description Given a binary tree, determine if it is height-balanced Example 1: Example 2: Example 3:

Description Given a binary tree, find its minimum depth. The minimum depth is the number of nodes al

Description Given a sequence of K elements, we can calculate its difference sequence by taking the d

Description Given the head of a linked list and an integer val, remove all the nodes of the linked l

Description You are given the heads of two sorted linked lists list1 and list2. Merge the two lists