Binary search tree

Given below is a binary search tree:

Find all positive integers that are not in the tree yet, but when added individually to a given tree, will result in an increase in its height. These values should be considered independently, with one value inserted into the tree at a time to assess its height change. Enter all the values that can be inserted into the tree, satisfying the given conditions, in ascending order.

For example, your output may look like this:

1 2 3 4 5 6