We are currently in a long serie of BST problems:
- 700. Search in a Binary Search Tree
-
- Trim a Binary Search Tree
-
- Convert BST to Greater Tree
-
- Increasing Order Search Tree
-
- Kth Smallest Element in a BST
-
- Recover Binary Search Tree
-
- Binary Search Tree Iterator
Not long ago there was this long serie of linked list problems.
Wouldn't it be nice if daily challenges showed a bit more of randomness ?