Algorithms and Data Structures: Binary Search Trees

Watch the first few minutes on us! If you'd like to watch the entire video and hundreds more like it, download code samples, access offline videos and skills assessments, and use the discussion forums, log in or purchase a subscription.


You must log in to view comments.


Razi bin Rais


The second video in this series tackles Binary Search Trees (BSTs). You'll learn what they are, how they work, how they differ from ordinary binary trees, and when to use them. Razi concludes by implementing a BST in C# to solidify the concepts presented.

Table of Contents

{{toc.Position}} {{toc.Text}}

Related Links

  • {{link.LinkText}} (requires a paid subscription)


This course is part of the following series: