摘要：
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public: pair search(TreeNode* root){ if(root == NULL) return make_pair(true , 0); pair l... 阅读全文
posted @ 2013-10-30 10:26 1957 阅读(166) 评论(0) 推荐(0) 编辑