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

# Full binary tree
Every node has either zero or two children.


# Complete Binary Tree
All levels except the last level are completely filled. In the last level, all the nodes are filled from left to right.

Heap, which we will discuss in later lessons, is an example of a complete binary tree.


# Perfect Binary Tree

A binary tree where all internal nodes have two children and all leaves are at the same level is a perfect binary tree.

A perfect binary tree of height $h$ has $2^{h} - 1$ nodes.

We'll go over some definitions of different types of tree. Remembering them and their properties will be useful for questions about binary trees.


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

Types of Binary Trees

Full binary tree

Complete Binary Tree

Perfect Binary Tree