There are also some cases while deleting nodes from the tree:
  - Deleting the leaf node;
  - Deleting the node with 1 child;
  - Deleting the node with 2 children.


**Deleting the leaf node**

We may simple remove the leaf node without any crucial changes in the tree.

**Deleting the node with 1 child:**
  
  - Replace that node with its child node;
  
  - Remove the child node from its original position.

**Deleting the node with 2 children:**
  
  - Get the inorder successor of that node;
  
  - Replace the node with the inorder successor;
  
  - Remove the inorder successor from its original position.
  

Algorithms and Data structures are the basements of computer programming. Moreover, you will learn this topic with easy examples. After the course, you will be filled with ADS knowledge, analytical thinging and a perfect mood!

In this section, we will learn ADS basics and main terms.

Linear data structures are waiting for you! Stack, queue, linked list, and hash table in the end!

In this section, we will learn the most famous trees and try to implement them with the help of Python.

Here we will learn not such famous trees but so interesting tree data structures!

BST Deletion