As an example of a binary tree, a simple quiz application will be developed. The quiz consists of a few questions and answers, shown depending on the previously$-$taken decisions. First you will get name, surname and age of the applicant. Then the application presents the question, waits until the user presses Y $($yes$)$ or N $($no$),$ and proceeds to the next question or shows the answer. When the quiz is finished, the apllication will show the result, such: