``` import java.util.ArrayList; import java.util.Arrays; import java.util.List; /** * Source : https://oj.leetcode.com/problems/flatten-binary-tree-to
Given a binary tree, flatten it to a linked list in-place. For example, Given 1 / \ 2 5 / \ \ 3 4 6 The flattened tree should look like: 1 \ 2 \ 3 \ 4 \ 5 \ 6 click to show hints. Hints: If you notice carefully in the flattened tree, each node's right child points ...
publicvoidflatten(TreeNoderoot){Stack<TreeNode>toVisit=newStack<>();TreeNodecur=root;TreeNodepre=null;while(cur!=null||!toVisit.isEmpty()){while(cur!=null){toVisit.push(cur);// 添加根节点cur=cur.right;// 递归添加右节点}cur=toVisit.peek();// 已经访问到最右的节点了// 在不存在左节...
public voidflatten(TreeNode root){if(root==null)return;flatten(root.right);flatten(root.left);} 1. 2. 3. 4. 5. 6. 实现了倒序遍历的逻辑以后,再进行结点之间的拼接: private TreeNode prev=null;public voidflatten(TreeNode root){if(root==null)return;flatten(root.right);flatten(root.left);...
114. Flatten Binary Tree to Linked List # 题目 # Given a binary tree, flatten it to a linked list in-place. For example, given the following tree: 1 / \ 2 5 / \ \ 3 4 6 The flattened tree should look like: 1 \ 2 \ 3 \ 4 \ 5 \ 6 题目大意 # 给定一个
LeetCode—108. Convert Sorted Array to Binary Search Tree 题目 https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/description/ 将一个递增数组转化为平衡二叉搜索树。平衡二叉搜索树首先是一个二叉搜索树,其次要求每一个节点的左右... ...
114. Flatten Binary Tree to Linked List 这道题自己一开始的做法是建立一个新链表然后再指向它,想到浪费空间看了题解 思路就是将左子树接在父节点的右子树上,将右子树接在左子树后,这样就是先序遍历的结果了 /** * Definition for a binary tree node....
也就是6作为5的右孩子,5作为4的右孩子,以此类推。 class Solution { private TreeNode prev = null; public void flatten(TreeNode root) { if (root == null) return; flatten(root.right); flatten(root.left); root.right = prev; root.left = null; prev = root; } }...
要求:Given a binary tree, flatten it to a linked list in-place.将二叉树转化为平坦序列的树。比如: 结题思路: 该题有个提示,转化后的树的序列正好是二叉树前序遍历所得到的序列,所以,该题第一个思路就是利用前序遍历的方式来做。 第二个思路:我们可以利用递归的思路,先对根节点进行处理,将root的左子...
Given a binary tree, flatten it to a linked list in-place. For example, Given 1 / \ 2 5 / \ \ 3 4 6 The flattened tree should look like: 1 \ 2 \ 3 \ 4 \ 5 \ 6 递归法 思路 相当于一次先序遍历, 将先访问的点存储在数组里, 下一个访问的节点为之前访问的点的右子树 ...