Skip navigation

Binary search tree

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

Trees are useful middle ground between array lists and linked lists. Brian introduces the binary search tree which is composed of nodes with 0, 1, or 2 subtrees. Elements in the left subtree are lesser than the node value. Elements in the right subtree are greater than the node value.

Resume Transcript Auto-Scroll
Skill Level Intermediate
4h 46m
Duration
45,335
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