5.1.14+-+5.1.17+Trees

=__**5.1.14 - Describe how trees operate logically (both binary and non-binary).**__= __**Link: Recursive Thinking**__
 * use boolean logical operators
 * graphical representation of boolean operations
 * boolean operations are logical connections of two situations/things
 * trees operate logically, as there are certain rules they follow (these rules do not change)
 * **Binary**
 * logical rules
 * starts with root, then each node can have a **left and a right child**
 * each node has one parent, except for the root
 * filled from left to right
 * starting at any node, moving upward will result with reaching the root
 * complete binary trees: required to fill in each level from left to right
 * **Non-binary**
 * general tree
 * organisational hierarchy
 * descending
 * logical mathematical formulas connected to tree
 * linked lists to access left child and then move right

Created By: Lucie Magister Last update: 21/04/2015

Sources:
 * Notes from class.
 * "Non-Binary Trees." (n.d.): n. pag. DIUBI. Web. 21 Apr. 2015. .