/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* struct TreeNode *left;
* struct TreeNode *right;
* };
*/
struct TreeNode* convertBiNode(struct TreeNode* root){
if(!root) return NULL;
if(!root->left && !root->right) return root;
struct TreeNode* x =root->left;
root->left=NULL;
struct TreeNode* leftroot=convertBiNode(x);
if(leftroot){
struct TreeNode* temp=leftroot;
while(temp->right) temp=temp->right;
temp->right=root;
}else{
leftroot=root;
}
struct TreeNode* rightroot=convertBiNode(root->right);
root->right=rightroot;
return leftroot;
}
标签:面试题,right,TreeNode,struct,temp,leftroot,BiNodec,17.12,root From: https://www.cnblogs.com/llllmz/p/18085652