Binary Search Trees

Enter some sequence of letters and dashes in the text box below.

Letters will be inserted from left to right into an initially empty
binary search tree. Preceding a letter with a dash will cause that
letter to be removed from the tree via Hibbard deletion using a
successor.