CSC148H1 Lecture Notes - Lecture 18: Arity, Branching Factor
1
CSC148H1 Full Course Notes
Verified Note
1 document
Document Summary
References: code seen in the pictures can be found on the csc148 website: http://www. cdf. utoronto. ca/~csc148h/winter. Tree- set of nodes (possibly with values or labels) with directed edges between some pairs of nodes. Each non-root node has exactly one parent. Path- sequence of nodes n1, n2, nk where there is an edge from ni, ni + 1. Length of path- number of edge sin it: unique path from root to each node. In the case of the root itself, this is just n1 if the root is node n1. There are no cycles no paths that form loops. Internal node- node with 1 or more children. Subtree- tree formed by any tree node together with its descendants. Height- 1 + maximum path length in a tree: also, nodes have height- 1 + maximum path length of tree rooted at that node. Depth- length of a path from root to node. Arity or branching factor- maximum number of children for any node.
