树相关算法

• 判断二叉树的后序遍历序列
• 多叉树的构建
• 二叉树中和为某一值的路径
  
• 树的子结构
  
• 对称的二叉树
  
• 二叉搜索树与双向链表
  
• 之字形打印二叉树
  
• 分行从上到下打印二叉树
  
• 树的子结构
  
• 208. Implement Trie (Prefix Tree)
  
• 根据先序遍历和中序遍历构建二叉树
• Tree Mirror output
• 二叉树系列——二叉树的最大距离
• 297. Serialize and Deserialize Binary Tree
• 270. Closest Binary Search Tree Value
  
• 117. Populating Next Right Pointers in Each Node II
  
• 116. Populating Next Right Pointers in Each Node
  
• 653. Two Sum IV - Input is a BST
  
• Equal Tree Partition
  
• 666. Path Sum IV
  
• 653. Two Sum IV - Input is a BST
  
• 742. Closest Leaf in a Binary Tree
  
• 220. Contains Duplicate III
  
• 687. Longest Univalue Path
  
• 623. Add One Row to Tree
  
• 655. Print Binary Tree
  
• 617. Merge Two Binary Trees
  
• 669. Trim a Binary Search Tree
  
• 235. Lowest Common Ancestor of a Binary Search Tree
  
• 114. Flatten Binary Tree to Linked List
  
• 222. Count Complete Tree Nodes
  
• 671. Second Minimum Node In a Binary Tree
  
• 230. Kth Smallest Element in a BST
  
• 310. Minimum Height Trees
  
• 449. Serialize and Deserialize BST
  
• 652. Find Duplicate Subtrees
  
• 606. Construct String from Binary Tree
  
• 404. Sum of Left Leaves
  
• 101. Symmetric Tree
  
• 450. Delete Node in a BST