Questions;

• How the Python function permute works, and its run time.

• What a binary tree is.

• Binary tree terminology: child, edge (link), empty tree, height (in terms of edges), internal node, external (leaf) node, left child, node (vertex), right child, root, parent, etc.

• What a complete binary tree is.

• What a nearly complete binary tree is.

• How to represent a nearly complete binary tree as an array.

• How to use and in algorithms.

• What a max-heap is.

• What a min-heap is.