Binary Tree Operations(I)

There are two kinds of traversal for (binary) trees: Depth First Search(DFS) and Breadth First Search(BFS). Depth First Search visits the tree by proceeding deeper and deeper until it reaches the leaf nodes, including pre-order, in-order, post-order tree traversal. DFS uses a data structure called Stack.

Breadth First Search is the most natural solution for level-order traversal, since it visits the nodes level by level. BFS requires the use of a data structure called Queue, which is a First In First Out (FIFO) structure.

For the complete C++ source code used in this article, please refer to: https://github.com/bo-yang/BinaryTree.

1. Data Structure
2. Build Binary Tree
3. Preorder Traversal
4. Inorder Traversal
5. Postorder Traversal
6. Breadth First Traversal
7. Zigzag Traversal
8. Binary Tree Comparison

Data Structure

- See more at: http://bo-yang.github.io/2014/05/26/binary-tree-traversal/#sthash.jgL6Z8yC.dpuf

http://bo-yang.github.io/2014/05/26/binary-tree-traversal