ABSTRACT
A tree is a data structure representing hierarchical data. Tree traversal can transform a tree into a linear structure.
In this section, experiments were organized in two fields: trees and binary trees. In experiments for trees, trees are used to solve not only hierarchical problems, but also other
problems, such as union-find sets. In experiments for binary trees, experiments for applications of binary trees and some classical
binary trees, such as BST, Heap, and Huffman tree, are shown.
