Is Pre-Order traversal on a binary tree same as Depth First Search?

algorithm tree binary-tree depth-first-search preorder
Srikanth Kandalam picture Srikanth Kandalam · Feb 5, 2014 · Viewed 30k times · Source

It seems to me like Pre-order traversal and DFS are same as in both the cases we traverse till the leaf node in a depth wise fashion. Could anyone please correct me if I am wrong?

Thanks in advance!

Answer

herohuyongtao picture herohuyongtao · Feb 5, 2014

Pre-order is one type of DFS.

There are three types of depth-first traversal: pre-order, in-order, and post-order.

Check out here for more info.

Related questions

Convert a binary tree to linked list, breadth first, constant storage/destructive

This is not homework, and I don't need to answer it, but now I have become obsessed :) The problem is: Design an algorithm to destructively flatten a binary tree to a linked list, breadth-first. Okay, easy enough. Just build a …

Read More
Diameter of Binary Tree - Better Design

I have written a code for finding diameter of Binary Tree. Need suggestions for the following: Can I do this without using static variable at class level? Is the algorithm fine/any suggestions? public class DiameterOfTree { public static int diameter = 0; …

Read More
How to convert a binary tree to binary search tree in-place, i.e., we cannot use any extra space

How to convert a binary tree to binary search tree in-place, i.e., we cannot use any extra space.

Read More