Resource: Ch. 6, "Trees", of Data Structures: Abstraction and Design Using Java, Exercises for Section 6.1; Self-Check #3

Complete the Self-Check Question #3 within "Exercises for Sections 6.1" subsection in Section 6.1, "Tree Terminology and Applications" of Ch. 6, "Trees" in Data Structures: Abstraction and Design Using Java.

Submit a document with the answers to the questions within the Self-Review Question to the Assignment Files tab.

3. For each tree shown below, answer these questions. What is its height? Is it a full tree? Is it a complete tree? Is it a binary search tree? If not, make it a binary search tree.

40 40 30 30 32 35 50 32