# Tree

- [Find Tree height (general iteration method)](/leetcode-notes/datastructure/tree/find-tree-height-general-iteration-method.md)
- [Check BST and Check CompleteTree](/leetcode-notes/datastructure/tree/check-bst-and-check-completetree.md)
- [ZigZag Order traversal](/leetcode-notes/datastructure/tree/zigzag-order-traversal.md)
- [Binary Tree diameter I](/leetcode-notes/datastructure/tree/binary-tree-diameter-i.md): 没有weight的二叉树直径, 直接用node的高度计算直径
- [Maximum Path Sum Binary Tree](/leetcode-notes/datastructure/tree/untitled.md): Laicode：  https://app.laicode.io/app/problem/138      二叉树任意两个leaf node的最大路径和
- [Maximum Path Sum Binary Tree II](/leetcode-notes/datastructure/tree/maximum-path-sum-binary-tree-ii.md): Hard.   二叉树任意两个节点的最大路径和
- [Binary Tree Path Sum To Target III](/leetcode-notes/datastructure/tree/binary-tree-path-sum-to-target-iii.md)
- [Tree diameter 树的直径II](/leetcode-notes/datastructure/tree/tree-diameter-shu-de-zhi-jing-ii.md): 这道题相对于binary tree diameter I + maximum path sum binary tree II +图的DFS
- [Tree ReConstruction](/leetcode-notes/datastructure/tree/tree-reconstruction.md)
- [Check if B is Subtree of A](/leetcode-notes/datastructure/tree/check-if-b-is-subtree-of-a.md)
- [The Kth smallest in Binary Search Tree](/leetcode-notes/datastructure/tree/the-kth-smallest-in-binary-search-tree.md): Medium; BST
- [打印Tree的右视图](/leetcode-notes/datastructure/tree/da-yin-tree-de-you-shi-tu.md): Medium; Tree
- [二叉搜索树的后序遍历序列](/leetcode-notes/datastructure/tree/er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie.md): Hard;
- [重建二叉树](/leetcode-notes/datastructure/tree/zhong-jian-er-cha-shu.md)
- [判断二叉树是否对称](/leetcode-notes/datastructure/tree/pan-duan-er-cha-shu-shi-fou-dui-cheng.md)
- [Path Sum to Target in Binary Tree](/leetcode-notes/datastructure/tree/sum-to-target-in-tree.md)
- [Tree-PreOrder-InOrder-PostOrder](/leetcode-notes/datastructure/tree/tree-preorder-inorder-postorder.md)
