It should mirror binary tree, so we need sections like - introduction - insertion - recursive visit - stack visit - queue visit - modifying the tree