Final Exam Review for CISP1020
==============================
1.  What is a tree?
2.  What is a binary tree?
3.  How many nodes will a full binary tree of depth d have?
4.  Be able to do an in-order traversal of a binary tree.
5.  Be able to do a postorder traversal of a binary tree.
6.  Be able to do a preorder traversal of a binary tree.
7.  Be able to do a breadth first traversal of a binary tree.
8.  What is a binary search tree?
9.  What is the main advantage of a binary search tree?
10. What is the degenerative case of binary search trees?
11. What is an AVL tree?
12. How does an AVL tree maintain balance?
13. What is the acceptable range of balance factors for an AVL tree?
14. What is the main advantage of an AVL tree?
15. What is a parse tree?
16. How are parse trees useful?
17. How can a parse tree be used to transform an infix statement into
    an RPN statement?
18. What is a heap?
19. How can a binary heap be represented in an array?
20. What is a min heap?
21. What is a max heap?
22. What are the main operations on a heap?
23. What are function pointers and why are they useful?
24. Know how to declare function pointers.
25. Know how to call a function from a function pointer.