Introduction to Binary Trees
Check your understanding of binary trees.
We'll cover the following...
Binary trees overview
This chapter introduces one of the most fundamental structures in computer science: binary trees. The use of the word tree here comes from the fact that, when we draw them, the resultant drawing often resembles the trees found in a forest. There are many ways of defining binary trees. Mathematically, a binary tree is a connected, undirected, finite graph with no cycles, and no vertex of degree greater than three.
For most computer science applications, binary trees are rooted: A special node, r
, of degree at most two is called the root of the tree. For every node, ...