栈实现的二叉树遍历

[{"title":"（ 9 个子文件 8KB ） 栈实现的二叉树遍历","children":[{"title":"nRecurson","children":[{"title":"Creat_Tree.c <span style='color:#111;'> 843B </span>","children":null,"spread":false},{"title":"main.c <span style='color:#111;'> 452B </span>","children":null,"spread":false},{"title":".Creat_Tree.c.swp <span style='color:#111;'> 12.00KB </span>","children":null,"spread":false},{"title":"head.h <span style='color:#111;'> 309B </span>","children":null,"spread":false},{"title":"makefile <span style='color:#111;'> 66B </span>","children":null,"spread":false},{"title":"nRecusion_Traver.c~ <span style='color:#111;'> 1.47KB </span>","children":null,"spread":false},{"title":"nRecusion_Traver.c <span style='color:#111;'> 1.58KB </span>","children":null,"spread":false},{"title":"Init.c <span style='color:#111;'> 260B </span>","children":null,"spread":false},{"title":"exe <span style='color:#111;'> 12.24KB </span>","children":null,"spread":false}],"spread":true}],"spread":true}]