Data Structures: How to implement a Binary Search Tree?
This video explains the implementation of a Binary Search Tree (BST). It explains how to add a value (node) to a BST, how to perform binary search on a binary search tree, and how to remove a value (node) from a binary search tree. For the removal of a node, three cases are covered: removing a leaf node, removing a node with a single child, and removing a node with two children.