D&A -- Learning Objectives Week 6
---------------------------------
students
* learn about functors and lambda expressions in C++. Get an intuition about programming in a functional way.
* see and apply a classic pattern form functional programming: map / filter /reduce.
* Learn to know the concept of a binary search tree, understand the additional operations possible (in comparison to dictionary) and learn and implement operations on the tree.
* learn to know the (Max- or Min-) Heap, a data structure that is particularly well suited to implement priority queues. Learn to know the duality between an array and a fully balanced tree
* learn to know more examples that argue on the height on binary trees (preparation for binary search trees and balanced trees in general)
* Understand the problem of unbalanced trees and learn about the guarantees that balancing in an AVL tree provides.
* See a closed form of Fibonacci numbers and see another technique to solve (some) recurrence equations via generating functions.
* Learn to know and train the operations on an AVL tree.