Gain insights into competitive programming, explore C++ skills with theory, code samples, practice problems, and master faster implementation for contests like ACM ICPC, Google CodeJam, and HackerCup.

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

# Binary Search Tree
Before we begin our discussion about Self-balancing BST (or Balanced BST). Let's recall what a BST is and why is there a need for an efficient variation.

BST is a rooted binary tree where:
* The left subtree of a node contains only nodes with smaller keys.
* The right subtree of a node contains only nodes with larger keys.


For example:

# Limitation
The order of keys matters while building a BST. That means that the same set of keys can result in different structures of the resulting BST depending on the order of insertion.

Let's take a simple example with 3 keys in different order:

1. $[1, 2, 3]$
2. $[2, 1, 3]$

Now let's see the resulting BSTs:

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

Balanced Binary Search Tree

Course Conclusion

Self-Balancing Binary Search Tree

Binary Search Tree

Limitation