huayu-learn
/
project
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
project/算法/learn/体系/12.二叉树基本算法（下）.md

214 B
Raw Blame History

用队列栈实现宽度优先遍历

  1. 队列弹出一个car并打印
  2. car有左入左,有右入右.

用栈实现深度优先遍历.

  1. 栈中弹出一个car并打印.
  2. 有右入右,有做入左.