2013年12月3日

Binary Tree Postorder Traversal

摘要： Given a binary tree, return thepostordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3return[3,2,1].No... 阅读全文

posted @ 2013-12-03 14:24 Step-BY-Step 阅读(432) 评论(0) 推荐(0) 编辑

Evaluate Reverse Polish Notation

摘要： Evaluate the value of an arithmetic expression inReverse Polish Notation.Valid operators are+,-,*,/. Each operand may be an integer or another expression.Some examples: ["2", "1", "+", "3", "*"] -> ((2 + 1) * 3) -> 9 ["4", "13&qu 阅读全文

posted @ 2013-12-03 14:18 Step-BY-Step 阅读(163) 评论(0) 推荐(0) 编辑

Data Structure Notes

该文被密码保护。 阅读全文

posted @ 2013-12-03 13:23 Step-BY-Step 阅读(2) 评论(0) 推荐(0) 编辑

导航