Binary Tree Practice for Data Structures Exam.
Be prepared to add and remove nodes from a tree.
Know the difference between preorder, postorder, and inorder traversal and the how these recursive implementations work.
You should know how to implement a deep copy of a tree.
You should know how to implement a deconstructor for a tree.
General Tree terminology.
-------------EXTREMLY IMPORTANT THAT YOU UNDERSTAND THE CODE!-----------