This is the third in a series of videos about binary trees. It explains the differences between three depth first traversal strategies, namely pre order, in order and post order. It illustrates a simple method for determining the order in which data will be retrieved by each of these depth first traversal strategies. Algorithms and pseudocode for each method of traversal are also examined, along with implementation code written in VB.NET.