Transcript Welcome Hello, and welcome to competitive programming. Today we are going to start talking about more serious data structures: in this case balanced trees and heaps.
Objectives We are, again, going to assume you know the basics of the balanced binary tree, either the AVL tree or the Red-Black tree.