Leetcode 105. Construct Binary Tree from Preorder and Inorder Traversa | | Leetcode 105. Construct Binary Tree from Preorder and Inorder Traversa 文章作者:Tyan博客:noahsnail.com | CSDN | 简书 1. Description 2. Solution12345678910111213141516171819202122232425262728293031323334353637/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public: TreeNode* buildTree(vector<int>& preorder, vector<int>& inorder) { int current = 0; return build(preorder, inorder, current, 0, preorder.size() - 1); } private: TreeNode* build(vector<int>& preorder, vector<int>& inorder, int& current, int start, int end) { if(current == preorder.size() || start > end) { return nullptr; } int value = preorder[current]; TreeNode* node = new TreeNode(value); int index = 0; for(int i = start; i <= end; i++) { if(inorder[i] == value) { index = i; break; } } current++; node->left = build(preorder, inorder, current, start, index - 1); node->right = build(preorder, inorder, current, index + 1, end); return node; }}; Reference https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/description/ 如果有收获,可以请我喝杯咖啡! 赏 微信打赏 支付宝打赏