Module: Trees

Learning Outcomes

Learn about and implement the Tree data structure

The student will:

• Explain the standard structure of a Tree.

• Implement binary trees.

• Implement binary search trees.

• Implement a Heap.

Understand recursion and how to develop recursive algorithms and programs

The student will:

• Use recursive algorithms to solve different problems.

• Write correct recursive Java code to solve different problems.

Learn about and implement pre-order, in-order, and post-order traversals

The student will:

• Explain the differences between pre-order, in-order and post-order traversals.

• Implement code to conduct pre-order, in-order and post-order traversals of binary trees.

Readings

Experiential Learning