Ultraviolet A 10821-constructing BST (BSF)

Link to the question: Ultraviolet A 10821-constructing BST

Given the number of nodes and the height of the tree, find the smallest insert sequence in the lexicographically order so that the generated BST height is H.

Solution: determine the number of left and right Subtrees Based on H. Because the Lexicographic Order is required to be as small as possible, the number of nodes in the right subtree should be as large as possible.

#include <cstdio>#include <cstring>#include <algorithm>using namespace std;int N, H;void solve (int l, int r, int h) {    if (l > r)        return;    int mid = max(r - (1<

Ultraviolet A 10821-constructing BST (BSF)