CMPSC 24 Lecture Notes - Lecture 13: Binary Tree, Binary Logarithm
Document Summary
Root = at the top of the tree. Parent-child = b is a parent of d+e, d+e are children of b. C is an ancestor of all the nodes below it. Interior/internal node = a node that is not a leaf. Subtree = h is a subtree of c, but not of a. Degree of a node = number of child nodes attached to it. A leaf node has a degree of zero. Level = root is at level, b+c are level 1, defgh are level 2, i is level 3. Height of tree = the maximum level of any node in the tree. General tree = the degree of nodes in a tree is not restricted. Trees = degree of nodes can be arbitrary. Ordered trees: nodes are ordered from left to right. Full binary tree = binary tree of height such that all nodes at every level are present. Binary tree is not always of logarithmic type.
