2013年6月6日
Binary Tree Inorder Traversal
摘要： Given a binary tree, return theinordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3return[1,3,2].Note:Recursive solution is trivial, could you do it iteratively?/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; ... 阅读全文
posted @ 2013-06-06 22:17 一只会思考的猪 阅读(105) 评论(0) 推荐(0)