Flatten Binary Tree to Linked List

iteye_6755

于 2015-08-31 13:27:03 发布

阅读量56

点赞数

分类专栏： leetcode

leetcode 专栏收录该内容

193 篇文章

订阅专栏

本文详细介绍了如何通过迭代方法将给定的二叉树结构平铺成链表形式，包括关键步骤、代码实现以及转换后的链表结构展示。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
	public void flatten(TreeNode root) {
		LinkedList<TreeNode> linkedList = new LinkedList<TreeNode>();
		TreeNode p = root;
		while (p != null || !linkedList.isEmpty()) {
			if (p.right != null) {
				linkedList.addFirst(p.right);
			}
			if (p.left != null) {
				p.right = p.left;
				p.left = null;
			} else if (!linkedList.isEmpty()) {
				p.right = linkedList.poll();
			}
			p = p.right;
		}
	}
}