Competitive programming can be a great way to build out your programming skills, get on any major company’s radar, and earn a little extra cash along the way.

In this course, you will learn to prepare for competitive programming contests like ACM ICPC, Google CodeJam, Facebook HackerCup, and many more.

Each topic is broken down with a healthy mix of theory, code samples, step-by-step solved sample problems, illustrations, useful practice problems, and tips and tricks for faster implementation.

You will need some solid C++ foundations coming into this course, but by the end it, you will be confident enough in your C++ skills to take home the win.

Competitive Programming in C++: The Keys to Success

# Deletion
While removing a node from a BST, three cases are possible:

1.  Node is a leaf
2. Node has only one child
3. Node has two children



In any case, we could end up traversing the entire tree in case of a skewed binary tree. So, the time complexity is $O(N)$.

## Node is a leaf
In this case, the node can simply be removed from the tree.


In the lesson, we'll see how to delete a key from a BST.

Introduction

Complexity Analysis

Number Theory

Arrays and Vectors

Sieve of Eratosthenes

Strings

Sorting

Linked List

Stack

Queue

Binary Tree

2 Pointers

Heap

Binary Search Tree

Course Conclusion

Deletion

Deletion

Node is a leaf