binary trees jj figure morse code modeled as binary decision tree given sequence in this casethe sequence represents the letter the path of the steps through the tree to decode the sequence is shown in figure jj figure decoding the morse code sequence what happens if we try to decode an invalid sequencefor exampletry decoding the sequence (this will take us from the root noderight to node tleft to node nright to node kand left to node the last symbol in the sequence is dotwhich indicates we are supposed to take the left branch at node cbut it has no left childas illustrated in figure if null child link is encountered during the navigation of the treewe know the sequence is invalid the adt definition we can define an abstract data type that can be used to store morse code tree for use in decoding morse code sequences the adt only includes two operationsthe constructor and the translate operations