ABSTRACT

Section III focuses on trees. A tree is a data structure representing hierarchical data. In this section, experiments are organized in two fields: trees and binary trees. In Chapter 8, experiments for hierarchical problems, tree storage structures, and union-find sets are shown. In Chapters 9 and 10, experiments for binary trees, such as traversal of binary trees, binary search trees, Huffman trees, and heaps, are shown.