3175. Find The First Player to win K Games in a Row
3175. Find The First Player to win K Games in a Row
Description
A competition consists of n players numbered from 0 to n - 1.
264C. Choosing Balls
1490. Clone N-ary Tree
Description
Given a root of an N-ary tree, return a deep copy (clone) of the tree.
1485. Clone Binary Tree With Random Pointer
1485. Clone Binary Tree With Random Pointer
Description
A binary tree is given such that each node contains an additional random pointer which could point to any node in the tree or null.
1110. Delete Nodes And Return Forest
1110. Delete Nodes And Return Forest
Description
Given the root of a binary tree, each node in the tree has a distinct value.
998. Maximum Binary Tree II
894. All Possible Full Binary Trees
894. All Possible Full Binary Trees
Description
Given an integer n, return a list of all possible full binary trees with n nodes. Each node of each tree in the answer must have Node.val == 0.
426. Convert Binary Search Tree to Sorted Doubly Linked List
426. Convert Binary Search Tree to Sorted Doubly Linked List
Description
Convert a Binary Search Tree to a sorted Circular Doubly-Linked List in place.
331. Verify Preorder Serialization of a Binary Tree
331. Verify Preorder Serialization of a Binary Tree
Description
One way to serialize a binary tree is to use preorder traversal . When we encounter a non-null node, we record the node’s value. If it is a null node, we record using a sentinel value such as '#'.