Chef Counts Semi-BSTs

CodeChefOpen on judge ↗

Everyone has heard of binary search trees or BSTs. A BST is a rooted tree, such that the root has at most two children. The subtree rooted at each of root's children should be valid BSTs. All the values in the left subtree should be smaller than the root and all the values in the right subtree should be larger than the root. However, there's a new data structure in town called semi-BST. Formally,

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI