Parallelization: Binary Tree Traversal
By Aaron Weeden and Patrick Royal
Shodor, Durham, North Carolina
This module teaches the use of binary trees to sort through large data sets, different traversal methods for binary trees, including parallel methods, and how to scale a binary tree traversal on multiple compute cores.
Upon completion of this module, students should be able to recognize the structure of a binary tree, employ different methods for traversing a binary tree, understand how to parallelize a binary tree traversal, and how to scale a binary tree traversal over multiple compute cores.
The documents can be downloaded below.
Resources:
Module Document (pdf) : The module document in PDF format.
Module Document (doc) : The module document in MS Word format.
Code : A zip file containing the source code for this module.
Exercise 4 Solution : Example Solution to Exercise 4.