binary tree

binary tree

1. The binary tree is a data structure

2. The binary tree consists of a root and nodes

   • the root and nodes may have 0,1, or 2 daughter nodes
     • a node with 0 daughter nodes is called a "leaf"
     • Each node has an element, which is its values
       • if the daughter node's element is less than its own element, the daughter is placed to the left.
       • if it's greater it's placed to the right