数据结构 -- 二叉树 遍历

二叉树遍历方式 Binary Tree Traversal 深度优先遍历（DFS） 前序遍历 Pre-order Traversal 跟–左—右顺序遍历 We start from A, and following pre-order traversal, we first visit A itself and then move to its left subtree B. B is also

>>阅读原文<<