1. Author: Takdir, S.ST. (takdir@stis.ac.id) © Sekolah Tinggi Ilmu Statistik

2. Ordered Tree: The sequence of node is important Ordered Tree: The sequence of node is important Unordered Tree: The sequence of node is not important Unordered Tree: The sequence of node is not important Equal Tree: if two unordered trees have the same subsets, then they are equal; but as ordered trees, they won’t be equal unless their equal subtrees are in the same order. Equal Tree: if two unordered trees have the same subsets, then they are equal; but as ordered trees, they won’t be equal unless their equal subtrees are in the same order. Author: Takdir, S.ST. (takdir@stis.ac.id) © Sekolah Tinggi Ilmu Statistik

3. A binary tree is an ordered tree in which every internal node has degree 2 (left sub tree and right sub tree) A binary tree is an ordered tree in which every internal node has degree 2 (left sub tree and right sub tree) An empty left sub tree is different from an empty right sub tree. An empty left sub tree is different from an empty right sub tree. Complete Binary Tree: Either a full binary tree or one that is full except for a segment of missing leaves on the right side of the bottom level. Complete Binary Tree: Either a full binary tree or one that is full except for a segment of missing leaves on the right side of the bottom level. Forest: Sequence of disjoint ordered trees. Forest: Sequence of disjoint ordered trees. Author: Takdir, S.ST. (takdir@stis.ac.id) © Sekolah Tinggi Ilmu Statistik

4. Unequal Ordered Tree: Unequal Binary Tree:

5. Author: Takdir, S.ST. (takdir@stis.ac.id) © Sekolah Tinggi Ilmu Statistik Complete binary trees:

6. Author: Takdir, S.ST. (takdir@stis.ac.id) © Sekolah Tinggi Ilmu Statistik

9. mlow = smallest key in the M (middle) subtree rlow = smallest key in the R (right) subtree

10. Author: Takdir, S.ST. (takdir@stis.ac.id) © Sekolah Tinggi Ilmu Statistik Five-Way Search Tree

11. Author: Takdir, S.ST. (takdir@stis.ac.id) © Sekolah Tinggi Ilmu Statistik