【leetcode刷题笔记】Flatten Binary Tree to Linked List

【【leetcode刷题笔记】Flatten Binary Tree to Linked List】的更多相关文章

【leetcode刷题笔记】Binary Tree Inorder Traversal

Given a binary tree, return the inorder traversal of its nodes' values. For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3 return [1,3,2]. Note: Recursive solution is trivial, could you do it iteratively? 解题:果然不能晚上做题,效率好低.看了讨论才学会的解法.设置一个指针next指向当前访问的…

【leetcode刷题笔记】Binary Tree Preorder Traversal

Given a binary tree, return the preorder traversal of its nodes' values. For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3 return [1,2,3]. Note: Recursive solution is trivial, could you do it iteratively? 解题:应该是很简单的一道题,纠结了好久T_T 基本思路很简单,用栈模拟就可以了.首先根节…

【leetcode刷题笔记】Binary Tree Level Order Traversal(JAVA)

Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). For example:Given binary tree {3,9,20,#,#,15,7}, / \ / \ return its level order traversal as: [ [], [,], [,] ] 题解:二叉树的层次遍历,用队列实现.重点在…

【leetcode刷题笔记】Binary Tree Level Order Traversal II

Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root). For example:Given binary tree {3,9,20,#,#,15,7}, 3 / \ 9 20 / \ 15 7 return its bottom-up level order tr…

【leetcode刷题笔记】Same Tree

Given two binary trees, write a function to check if they are equal or not. Two binary trees are considered equal if they are structurally identical and the nodes have the same value. 解题:还是简单的递归,把情况考虑清楚就可以了: 根节点都为空,树相同: 根节点一方为空,另一方不为空,树不相同: 根节点值不想等,树…