To interpret the results of the Search Tree, keep in mind the theoretical ideal shape of a Search Tree, which looks like the figure below.

To spot possible problems in your application, analyze the right subtrees in your Search Tree.

For a binary tree, considering that the right branch is the contradiction of the left branch, when right subtrees are developed you can draw one of the following two conclusions:

When you use the Depth First Search exploration order, the higher in the tree the right subtrees are, the more you should pay attention to them, because the tree is potentially exponential in its depth.