DFS & BFS--Data Structure

Two ways of traversal : DFS, BFS Three methods to implement DFS: InOrderTraversal (tree)   if (tree == null) return;   InOrderTraversal (tree.left);   Print (tree.key);   InOrderTraversal (tree.right)

>>阅读原文<<