Match the following data structures and algorithms which are most commonly and optimally used for the following operations:

Implementing a set or map

Implementing a file system

Implementing a destructor in a Binary Search Tree

Creating a copy of a Tree

$[$ Choose $]$ Postorder traversal Circular Linked List B$+$ Trees Preorder traversal Inorder traversal AVL Trees Splay Trees Stack

Red black trees Doubly Linked List with Tail Queue

Binary Search Tree Vector