$2.$ Choose the concept that best matches each description:

Group of answer choices

It is a self$-$balancing binary search tree, but it doesn't store extra information at each node to keep balance. The main idea is to splay every node to the root as long as it's accessed.

$[$ Choose $]$Greedy technique$$AVL Tree$$Divide and Conquer technique$$Dynamic Programming technique$$Splay Tree$$Complete Tree$$Red Black Tree$$

This design technique is to solve the problem through a sequence of steps. For each step, it takes the best choice at that moment.

$[$ Choose $]$Greedy technique$$AVL Tree$$Divide and Conquer technique$$Dynamic Programming technique$$Splay Tree$$Complete Tree$$Red Black Tree$$

This type of binary search tree keeps balanced through recoloring and tree rotation operations