Skip to main content
Lesson 34 - Binary Trees
Lesson MenuNext
  
Introduction page 1 of 7

A binary tree is a different kind of data structure that demands new terminology and algorithms. A binary tree node will have two pointers available for linking with other nodes, resulting in diagrams that look like inverted trees. A binary tree will begin with one node at the top and branch out below. As you might expect, the potential of going one of two different ways leads to some challenging programming problems. In fact, the idea of trying one direction, then backtracking must lead to recursion. The recursive algorithms used to traverse binary trees are very elegant and compact, but difficult to understand. But, one step at a time; first we need to learn how to talk about binary trees (vocabulary) and then build one (an algorithm).

The key topics for this lesson are:


Lesson MenuNext
Contact
 ©ICT 2003, All Rights Reserved.