Description https://leetcode.com/problems/delete-nodes-and-return-forest/ Given the root of a binary tree, each node in the tree has a distinct value. After deleting all nodes…

Description https://leetcode.com/problems/closest-binary-search-tree-value-ii/ Given the root of a binary search tree, a target value, and an integer k, return the k values in the BST that are closest to…

Description https://leetcode.com/problems/minimum-size-subarray-sum/ You have a graph of n nodes labeled from 0 to n – 1. You are given an integer n and a list…

Description https://leetcode.com/problems/unique-binary-search-trees/ Given an integer n, return the number of structurally unique BST’s (binary search trees) which has exactly n nodes of unique values from 1 to n.…

Description https://leetcode.com/problems/find-duplicate-subtrees/ Given the root of a binary tree, return all duplicate subtrees. For each kind of duplicate subtrees, you only need to…

Description https://leetcode.com/problems/license-key-formatting/ You are given a license key represented as a string s that consists of only alphanumeric characters and dashes. The…

Description https://leetcode.com/problems/maximum-level-sum-of-a-binary-tree/ Given the root of a binary tree, the level of its root is 1, the level of its children is 2, and…

Description https://leetcode.com/problems/all-possible-full-binary-trees/ Given an integer n, return a list of all possible full binary trees with n nodes. Each node of each tree in the answer…

Description https://leetcode.com/problems/binary-tree-maximum-path-sum/ A path in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence…

Description https://leetcode.com/problems/binary-search-tree-iterator/ Implement the BSTIterator class that represents an iterator over the in-order traversal of a binary search tree (BST): BSTIterator(TreeNode root) Initializes an object…