力扣 面试题 17.12

1、

        TreeNode* res = new TreeNode(vec.front());

        TreeNode* head = res;

中间变量 head 相当于一个开路者，不能没有他不然返回的只有最后一个节点

/**
 * 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:
vector<int> vec;
    TreeNode* convertBiNode(TreeNode* root) {
        if(root==nullptr) return NULL;
        inorder(root);
        TreeNode* res = new TreeNode(vec.front());
        TreeNode* head = res;
        for(int i=1;i<vec.size();i++)
        {
            head->left=NULL;
            head->right=new TreeNode(vec[i]);
            head=head->right;
        }
        return res;
        
    }
    void inorder(TreeNode* root)
    {
        if(root==nullptr) return;
        inorder(root->left);
        vec.push_back(root->val);
        inorder(root->right);
    }
};