CS174: Module 15: Introduction To Binary Trees
Developed by Professor Tralie and Professor Mongan.
Please watch the video below, and click the next button once you have finished
Notes
- A binary tree is a generalization where every node has both a
left
and aright
reference to other nodes, known as the left and right child nodes, respectively. - Binary trees are drawn from top to bottom by convention. The top node where a binary tree starts is called the
root
node - If a node
c
is the child of a nodep
, thenp
is referred to asc
's parent. - Binary trees are naturally recursive data structure, as an entire subtree can be spliced in by making the left child of a node be the root of that subtree.