``` import java.util.ArrayList; import java.util.Arrays; import java.util.List; /** * Source : https://oj.leetcode.com/problems/flatten-binary-tree-to
1/**2* Definition for a binary tree node.3* struct TreeNode {4* int val;5* TreeNode *left;6* TreeNode *right;7* TreeNode() : val(0), left(nullptr), right(nullptr) {}8* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}9* TreeNode(int x, TreeNode *left, Tr...
LeetCode—108. Convert Sorted Array to Binary Search Tree 题目 https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/description/ 将一个递增数组转化为平衡二叉搜索树。平衡二叉搜索树首先是一个二叉搜索树,其次要求每一个节点的左右... ...
packageleetcode/** * Definition for a binary tree node. * type TreeNode struct { * Val int * Left *TreeNode * Right *TreeNode * } */// 解法一 非递归funcflatten(root*TreeNode){list,cur:=[]int{},&TreeNode{}preorder(root,&list)cur=rootfori:=1;i<len(list);i++{cur.Left=nil...
publicvoidPrintBinaryTreeBacRecur(TreeNode<T>root){if(root==null)return;PrintBinaryTreeBacRecur(root.right);PrintBinaryTreeBacRecur(root.left);System.out.print(root.data);} 这里的话,我们不再是打印根节点,而是利用一个全局变量pre,更新当前根节点的右指针为pre,左指针为null。
一、原题114. Flatten Binary Tree to Linked List 二、前序遍历 + 展成单链 两步方式 首先通过前序遍历将节点存储到vector 中,然后将vector中的节点展成单链形式。 前序遍历(递归方式实现) /*** Definition for a binary tree node.* struct TreeNode {* int val;* TreeNode *left;* TreeNode *right...
TreeNode *left; TreeNode *right; TreeNode() {} TreeNode(int val) : val(val) {} TreeNode(int val, TreeNode *left, TreeNode *right) : val(val), left(left), right(right) {} }; class Solution { public: void flatten(TreeNode* root) { ...
114. Flatten Binary Tree to Linked List 这道题自己一开始的做法是建立一个新链表然后再指向它,想到浪费空间看了题解 思路就是将左子树接在父节点的右子树上,将右子树接在左子树后,这样就是先序遍历的结果了 /** * Definition for a binary tree node....
114. Flatten Binary Tree to Linked List 题目: https://leetcode.com/problems/flatten-binary-tree-to-linked-list/ 难度: Medium 有hint,又是玩DFS的preorder,用的loop,也不算很聪明的算法 用stack来放node,每次把pop出来的node左边变成null,把它的ri...猜...
[leetcode] 114. Flatten Binary Tree to Linked List Description Given a binary tree, flatten it to a linked list in-place. For example, given the following tree: 1 / \ 2 5 / \ \ 3 4 6 1. 2. 3. 4. 5. The flattened tree should look like:...