Delete a node from Binary Search Tree @mycodeschool

Delete a node from Binary Search Tree @mycodeschool

Uploaded May 2014 | Updated September 2026, 2 weeks ago

See complete series on data structures here:
youtube.com/playlist?list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P

In this lesson, we have discussed deletion of a node from binary search tree data structure. We have discussed the core logic and written implementation of it in C++.

See source code here:
gist.github.com/mycodeschool/9465a188248b624afdbf

For practice problems and more, visit: mycodeschool.com

Like us on Facebook: facebook.com/MyCodeSchool

Follow us on twitter: twitter.com/mycodeschool

Delete a node from Binary Search Tree

Binary tree traversal: Preorder, Inorder, Postorder

Introduction to pointers in C/C++

Reverse a string or linked list using stack.

BST implementation - memory allocation in stack and heap

Insertion sort algorithm

What is binary search

Infix, Prefix and Postfix

Graph Representation part 03 - Adjacency List

Data Structures: Arrays vs Linked Lists

Installing and configuring gcc / g++ on Windows.

Modular exponentiation - using Recursion

Delete a node from Binary Search Tree