2015年3月17日
[LeetCode] 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... 阅读全文
posted @ 2015-03-17 23:23 A_zhu 阅读(174) 评论(0) 推荐(0)
[LeetCode] Evaluate Reverse Polish Notation stack 栈
摘要： Evaluate the value of an arithmetic expression inReverse Polish Notation.Valid operators are+,-,*,/. Each operand may be an integer or another express... 阅读全文
posted @ 2015-03-17 23:08 A_zhu 阅读(233) 评论(0) 推荐(0)