C++ Binary Search Trees Essentials Video

C++ Binary Search Trees Essentials Video

Objectives:

1. Be able to explain the concept of a binary search tree (BST) and the BST’s advantage over a binary tree. In a BST, all of the elements that are lesser than the current node will be in the left subtree of the node, and all of the elements that are greater than the current node will be in the right subtree of the node.
2. Learn how to insert nodes into the tree.
3. Learn how to implement a binary search tree.
4. Appreciate the approach to search within a binary search tree.
5. See how to search within a binary search tree and how to use a Boolean function to assist with the search.
6. Appreciate the approach required to delete nodes within a binary search tree.
7. Learn how to delete nodes within a binary search tree in C++.

Instructor: Advait Jayant

Length: 1 hour

Access period: For one year starting from purchase date