Skip navigation

On September 14th, 2017, we published revised versions of our Privacy Policy, Terms of Service and Website Use Policy and published a Cookie Policy. Your continued use of Lynda.com means you agree to these revised documents, so please take a few minutes to read and understand them.

Exercise 8: Binary search tree

Exercise 8: Binary search tree: Four Semesters of Computer Science in 5 Hours
Exercise 8: Binary search tree: Four Semesters of Computer Science in 5 Hours

In this exercise, you must create a binary search tree. The tree class will keep track of a root which will be the first item added. From there, if the item is less than the value of that node, it will go into its left subtree, and if greater, it will go to the right subtree.

Resume Transcript Auto-Scroll
Skill Level Intermediate
4h 46m
Duration
58,208
Views
Show More Show Less

Continue Assessment

You started this assessment previously and didn't complete it. You can pick up where you left off, or start over.

Start Your Free Trial Now

Start your free trial now, and begin learning software, business and creative skills—anytime, anywhere—with video instruction from recognized industry experts.

Start Your Free Trial Now