Give your most concise answer to the following questions:

- what is a complete tree, binary search tree, binary tree, perfect tree and differences/similiarites between these trees (this question is also listed in Priority Queues)

- give the inorder traversal, preorder traversal, postorder traversal level order traversal of a tree

- write or revise some code for the operations on trees -

what is an m-ary tree? Understand the number of keys stored in a node to the number of branches. When is an m-ary tree, such as a B-tree used?

- pros/cons of AVL Tree to M-ary tree, an Binary Search Tree to an AVL tree, runtimes of operations on these types of ADTs