binary tree

binary tree

1. a binary tree is a nonlinear data structure

2. it consists of a root and nodes

   • the root and nodes may have 0, 1, or 2 daughter nodes
     • if a node has 0 daughters, it is called a "leaf"
     • if the daughter's element is less than the node's that daughter goes to the left
     • if its value is more, it goes to the right
   • the value associated with a node is its element

3. a function must begin with the root

   • the function moves to the left or right accordingly
     • such a function