I have a few questions in data structures. Can someone help me understand and explain clearly?

1. If given a digram and asked to find out if it is a heap or tree or binary tree or a trie? how do we do that? and why/why not?

2. if there are 6-7 nodes in a binary search tree, How do we insert the value in to it and how do we delete that value? how does it look like?

3. RED BLACK TREE- insert and delete node. clearl expalin the definition of a redblack tree

4. Recursion: Draw a picture of what happens with the stack.

5. Heaps: delete and insert from the heap and show the final representation

6. rules, diagrams and description (insert/delete) for heaps, trees, bst, tries,redblack tree, recursion etc.