solutions
search
Ctrlk
  • solutions
  • Valid Palindrome
  • String to Integer (atoi)
  • addBinary
  • Longest Palindromic Substring
  • Regular Expression Matching
  • Valid Number
  • Count and say
  • Valid anagram
  • Simplify Path
  • Length of last word
  • Longest Valid Parentheses
  • Valid Parentheses
  • Largest Rectangle in Histogram
  • Evaluate Reverse Polish Notationchevron-right
  • Binary Tree Preorder Traversalchevron-right
  • Binary Tree Inorder Traversalchevron-right
  • Binary Tree Postorder Traversalchevron-right
  • Binary Tree Level Order Traversalchevron-right
  • Binary Tree Zigzag Level Order Traversalchevron-right
  • Recover Binary Search Treechevron-right
  • Same Tree
  • Symmetric Treechevron-right
  • Balanced Binary Tree
  • Flatten Binary Tree to Linked Listchevron-right
    • Iterative and recursive
  • Populating Next Right Pointers in Each Node IIchevron-right
  • Construct Binary Tree from Preorder and Inorder Traversal
  • Construct Binary Tree from Inorder and Postorder Traversal
  • Unique Binary Search Trees
  • Validate Binary Search Tree
  • Convert Sorted Array to Binary Search Tree
  • Convert Sorted List to Binary Search Tree
  • Minimum Depth of Binary Tree
  • Maximum Depth of Binary Tree
  • Path Sum
  • Path Sum II
  • Binary Tree Maximum Path Sum
  • Populating Next Right Pointers in Each Node
  • Sum Root to Leaf Numbers
  • Merge Sorted Array
  • Merge Two Sorted Listschevron-right
  • Merge k Sorted Listschevron-right
  • Insertion Sort List
  • Sort List
  • First Missing Positive
  • Sort Colors
  • Search for a Range
  • Search Insert Positionchevron-right
  • Search a 2D Matrix
  • *string 的子集(bit)
  • Subsetschevron-right
  • Subsets IIchevron-right
  • Permutations
  • Permutations IIchevron-right
  • CPP
  • Combinationschevron-right
  • Iterative
  • Letter Combinations of a Phone Numberchevron-right
  • BFS VS DFS
  • Word Ladderchevron-right
gitbookPowered by GitBook
block-quoteOn this pagechevron-down
  1. Flatten Binary Tree to Linked List

Iterative and recursive

http://www.cnblogs.com/easonliu/p/3646841.htmlarrow-up-right

PreviousFlatten Binary Tree to Linked Listchevron-leftNextPopulating Next Right Pointers in Each Node IIchevron-right

Last updated 6 years ago