摘要: 二叉树遍历的递归写法: cpp vector preorderTraversal(TreeNode root) { vector res; stack temp; if(root == NULL) return res; temp.push(root); while(!temp.empty()) { 阅读全文
posted @ 2017-04-24 19:48 草滩小恪 阅读(381) 评论(0) 推荐(0) 编辑