JAVA

You are in a maze. The maze is organized like a binary search tree. The maze will have 9-16 nodes. A node is a place where you have to choose between turning right and turning left Each node is labeled with a letter of the alphabet Your job is to implement the maze in code. Create a method which, when given a leaf, will traverse the tree, printing its path as it goes. Choose five leaves and print the path through the maze determined by the letters on the leaves. This means to choose five letters and call the method five times. first you will have to build a binary tree with the alphabet in it.