Skip navigation

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
134,959
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 My Free Month

Start your free month on LinkedIn Learning, which now features 100% of Lynda.com courses. Develop in-demand skills with access to thousands of expert-led courses on business, tech and creative topics.

Start My Free Month

You are now leaving Lynda.com and will be automatically redirected to LinkedIn Learning to start your free trial.