Tree.md (896B)
1 # Tree 2 3 Abstract Math and CS202 4 5 **Definition:** Trees are connected graphs without cycles. 6 7 There is no implication about split numbers or anything of the sort, but something interesting is that in all cases it must be true that the number of edges is one less than the number of vertices. This can be proved through [Strong Induction](StrongInduction.md) 8 9 **Root:** This is a node that has no parents 10 11 **Parent:** The node above a given node 12 13 **Child:** A node below a given node 14 15 **Leaf:** These are nodes without children 16 17 **Subtree:** A subtree is a section of a tree that is based upon a new root node that cuts off everything above it. 18 19 See [Linked Lists](LinkedLists.md) as linked lists (when non-cyclic) are a form of tree. 20 21 Also see [Binary Tree](BinaryTree.md) for a specific tree type. 22 23 Note: A graph with 0 or 1 nodes are both trees because there is a connection between all nodes.