摘要:
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++给定一个二叉树,返回他的前序遍历的节点的values。例如: 给定一个二叉树{1,#,2,3}, 1 \ 2 / 3返回[1,2,3].笔记:递归解决方案是微不足道的,你可以用迭代的方法吗?++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++Given a binary tree, retur... 阅读全文