leetcode_question_114 Flatten Binary Tree to Linked List

Given a binary tree, flatten it to a linked list in-place.

For example,
Given

The flattened tree should look like:

Hints:

If you notice carefully in the flattened tree, each node's right child points to the next node of a pre-order traversal.

void flatten(TreeNode *root) {

        // Start typing your C/C++ solution below

        // DO NOT write int main() function

        if(root==NULL) return;

        if(root->left == NULL && root->right == NULL) return;

		flatten(root->left);

		flatten(root->right);

		TreeNode* tmpright = root->right;

		root->right = root->left;

		root->left = NULL;

		TreeNode* tmp = root;

		while(tmp->right)

			tmp = tmp->right;

		tmp->right = tmpright;

        return;

    }

巴特西

leetcode_question_114 Flatten Binary Tree to Linked List

最新文章

热门文章