[leetcode] Flatten Binary Tree to Linked List

最新推荐文章于 2022-09-06 16:04:14 发布

原创最新推荐文章于 2022-09-06 16:04:14 发布 · 331 阅读

0 ·

CC 4.0 BY-SA版权

Leetcode 专栏收录该内容

222 篇文章

订阅专栏

本文介绍了一种将任意二叉树通过修改指针的方式转换为单链表的方法。该过程不会使用额外的数据结构，并保持节点原有的相对顺序。通过对二叉树的右子树进行暂存和遍历调整左子树来实现这一目标。

From : https://leetcode.com/problems/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:

/**
 * 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:
    void flatten(TreeNode* root) {
        stack<TreeNode *> box;
		TreeNode* cur=root;
		while(cur) {
			if(cur->right && cur->left) box.push(cur->right);
			if(cur->left) {
				cur->right = cur->left;
				cur->left = NULL;
			}
			cur = cur->right;
			if(cur && !cur->left && !cur->right && !box.empty()) {
				cur->left = box.top();
				box.pop();
			}
		}
    }
};