1. UOP ECET 370 W EEK 7 L AB 7 B INARY T REES C HECK THIS A+ TUTORIAL GUIDELINE AT HTTP :// WWW. ASSIGNMENTCLOUD. COM / ECET -370/ ECET -370- WEEK -7- LAB -7- BINARY - TREES F OR MORE CLASSES VISIT HTTP :// WWW. ASSIGNMENTCLOUD. COM ECET 370 W EEK 7 L AB 7 B INARY T REES F ULL SET OF LAB WITH WORKING PROGRAMS. E XERCISE 1: L ECTURE REVIEW : B INARY S EARCH T REE C REATE A PROJECT USING THE CLASSES B INARY S EARCH T REE, N ODE, AND M AIN IN THE D OC S HARING AREA LABELED “T HE BST." C OMPILE THE PROJECT, RUN IT, AND REVIEW THE CODE THAT IS GIVEN CAREFULLY. T HESE PROGRAMS TEST THE CODE DISCUSSED IN OUR LECTURE. E XERCISE 2: A N IMPROVED BST CLASS M ODIFY THE CLASS B INARY S EARCH T REE SO THAT IT CONTAINS THE TO S TRING METHOD, INSTEAD OF THE DISPLAY METHOD THAT WAS GIVEN ORIGINALLY. E XERCISE 3: U SING A BST IN AN APPLICATION U SE A BINARY SEARCH TREE TO IMPLEMENT A DICTIONARY THAT CONTAINS THE KEYWORDS IN THE J AVA LANGUAGE. T EST IT. N OTE THAT YOU CAN USE THE PROGRAMS FROM THE PREVIOUS EXERCISES. F OR A LIST OF THE KEYWORDS IN J AVA, VISIT HTTP :// JAVA. SUN. COM / DOCS / BOOKS / TUTORIAL / JAVA / NUTSANDBOLTS /_ KEYWORDS. HTML. E XERCISE 4: R ECURSION AND B INARY T REES W RITE A RECURSIVE ALGORITHM THAT COUNTS THE NODES IN A BINARY SEARCH TREE. HTTP :// WWW. ASSIGNMENTCLOUD. COM / ECET -370/ ECET -370- WEEK -7- LAB -7- BINARY - TREES HTTP :// WWW. ASSIGNMENTCLOUD. COM