The given binary makes a binary search tree from some fixed string and the
given string just tells the program how to navigate the data. D prints the
character at that node and resets the current node to the root, L goes left,
and R goes right.