2013年7月1日
Leetcode::Construct Binary Tree from Inorder and Postorder Traversal
摘要： /** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public: TreeNode *build( vector&inorder, vector &postorder,int in_s,int in_e, int pos_s, int pos_e) ... 阅读全文
posted @ 2013-07-01 08:39 NinaGood 阅读(119) 评论(0) 推荐(0)