CSC148H5 Lecture Notes - Lecture 16: Data Structure
Document Summary
The root can have a set of nodes connected to it (children): Nodes at the bottom of thre tree which have no children are called leaves. Parent: parent of all nodes it has outgoing edges to. Siblings: set of nodes that share a common parent internal node: nonleaf node. Path: sequence of nodes n1,n2,,nk where there is an edge from n1 to n2,n2 to n3. Subtree: a subtree of tree t is a tree whose root node r is a node in t and which consists of all the descendants of t. Branching factor: maximum number of children of any node. Level(depth): the level (or depth) of node n is the number of edges on the path from the root node to n. the level of the root is 0. Length of path: number of edges on a path. Traverse tree: visit the nodes in some order, apply some operation on each node.
.jpg)
