前序遍歷和中序遍歷構造二叉樹[lintcode]

/** * Definition of TreeNode: * class TreeNode { * public: * int val; * TreeNode *left, *right; * TreeNode(int val) { * this->val = val; * this->left = this->right = NULL; * } * } */ class Solution

>>阅读原文<<