# Tree

- [94 Binary Tree Inorder Traversal](/oj-practices/chapter1/tree/94-binary-tree-inorder-traversal.md)
- [98 Validate Binary Search Tree](/oj-practices/chapter1/tree/98-validate-binary-search-tree.md)
- [99 Recover Binary Search Tree](/oj-practices/chapter1/tree/99-recover-binary-search-tree.md)
- [100     Same Tree](/oj-practices/chapter1/tree/100-same-tree.md)
- [101    Symmetric Tree](/oj-practices/chapter1/tree/101-symmetric-tree.md)
- [102     Binary Tree Level Order Traversal](/oj-practices/chapter1/tree/102-binary-tree-level-order-traversal.md)
- [103     Binary Tree Zigzag Level Order Traversal](/oj-practices/chapter1/tree/103-binary-tree-zigzag-level-order-traversal.md)
- [104 Maximum Depth of Binary Tree](/oj-practices/chapter1/tree/104-maximum-depth-of-binary-tree.md)
- [105     Construct Binary Tree from Preorder and Inorder Traversal](/oj-practices/chapter1/tree/105-construct-binary-tree-from-preorder-and-inorder-traversal.md)
- [106     Construct Binary Tree from Inorder and Postorder Traversal](/oj-practices/chapter1/tree/106-construct-binary-tree-from-inorder-and-postorder-traversal.md)
- [107     Binary Tree Level Order Traversal II](/oj-practices/chapter1/tree/107-binary-tree-level-order-traversal-ii.md)
- [108     Convert Sorted Array to Binary Search Tree](/oj-practices/chapter1/tree/108-convert-sorted-array-to-binary-search-tree.md)
- [110     Balanced Binary Tree](/oj-practices/chapter1/tree/110-balanced-binary-tree.md)
- [111     Minimum Depth of Binary Tree](/oj-practices/chapter1/tree/111-minimum-depth-of-binary-tree.md)
- [112     Path Sum](/oj-practices/chapter1/tree/112-path-sum.md)
- [113     Path Sum II](/oj-practices/chapter1/tree/113-path-sum-ii.md)
- [114     Flatten Binary Tree to Linked List](/oj-practices/chapter1/tree/114-flatten-binary-tree-to-linked-list.md)
- [116     Populating Next Right Pointers in Each Node](/oj-practices/chapter1/tree/116-populating-next-right-pointers-in-each-node.md)
- [117     Populating Next Right Pointers in Each Node II](/oj-practices/chapter1/tree/117-populating-next-right-pointers-in-each-node-ii.md)
- [124     Binary Tree Maximum Path Sum](/oj-practices/chapter1/tree/124-binary-tree-maximum-path-sum.md)
- [129     Sum Root to Leaf Numbers](/oj-practices/chapter1/tree/129-sum-root-to-leaf-numbers.md)
- [144     Binary Tree Preorder Traversal](/oj-practices/chapter1/tree/144-binary-tree-preorder-traversal.md)
- [145     Binary Tree Postorder Traversal](/oj-practices/chapter1/tree/145-binary-tree-postorder-traversal.md)
- [156     Binary Tree Upside Down](/oj-practices/chapter1/tree/156-binary-tree-upside-down.md)
- [173     Binary Search Tree Iterator](/oj-practices/chapter1/tree/173-binary-search-tree-iterator.md)
- [199     Binary Tree Right Side View](/oj-practices/chapter1/tree/199-binary-tree-right-side-view.md)
- [222     Count Complete Tree Nodes](/oj-practices/chapter1/tree/222-count-complete-tree-nodes.md)
- [226     Invert Binary Tree](/oj-practices/chapter1/tree/226-invert-binary-tree.md)
- [230     Kth Smallest Element in a BST](/oj-practices/chapter1/tree/230-kth-smallest-element-in-a-bst.md)
- [235     Lowest Common Ancestor of a Binary Search Tree](/oj-practices/chapter1/tree/235-lowest-common-ancestor-of-a-binary-search-tree.md)
- [236     Lowest Common Ancestor of a Binary Tree](/oj-practices/chapter1/tree/236-lowest-common-ancestor-of-a-binary-tree.md)
- [250     Count Univalue Subtrees](/oj-practices/chapter1/tree/250-count-univalue-subtrees.md)
- [255     Verify Preorder Sequence in Binary Search Tree](/oj-practices/chapter1/tree/255-verify-preorder-sequence-in-binary-search-tree.md)
- [257     Binary Tree Paths](/oj-practices/chapter1/tree/257-binary-tree-paths.md)
- [270     Closest Binary Search Tree Value](/oj-practices/chapter1/tree/270-closest-binary-search-tree-value.md)
- [272     Closest Binary Search Tree Value II](/oj-practices/chapter1/tree/272-closest-binary-search-tree-value-ii.md)
- [285     Inorder Successor in BST](/oj-practices/chapter1/tree/285-inorder-successor-in-bst.md)
- [297     Serialize and Deserialize Binary Tree](/oj-practices/chapter1/tree/297-serialize-and-deserialize-binary-tree.md)
- [314 Binary Tree Vertical Order Traversal](/oj-practices/chapter1/tree/314-binary-tree-vertical-order-traversal.md)
- [333     Largest BST Subtree](/oj-practices/chapter1/tree/333-largest-bst-subtree.md)
- [366 Find Leaves of Binary Tree](/oj-practices/chapter1/tree/366-find-leaves-of-binary-tree.md)
- [404     Sum of Left Leaves](/oj-practices/chapter1/tree/404-sum-of-left-leaves.md)
- [437     Path Sum III](/oj-practices/chapter1/tree/437-path-sum-iii.md)
- [449     Serialize and Deserialize BST](/oj-practices/chapter1/tree/449-serialize-and-deserialize-bst.md)
- [450     Delete Node in a BST](/oj-practices/chapter1/tree/450-deletenode-in-a-bst.md)
- [501     Find Mode in Binary Search Tree](/oj-practices/chapter1/tree/501-find-mode-in-binary-search-tree.md)
- [508     Most Frequent Subtree Sum](/oj-practices/chapter1/tree/508-most-frequent-subtree-sum.md)
- [513     Find Bottom Left Tree Value](/oj-practices/chapter1/tree/513-find-bottom-left-tree-value.md)
- [515     Find Largest Value in Each Tree Row](/oj-practices/chapter1/tree/515-find-largest-value-in-each-tree-row.md)
- [536     Construct Binary Tree from String](/oj-practices/chapter1/tree/536-constructbinary-tree-from-string.md)
- [538     Convert BST to Greater Tree](/oj-practices/chapter1/tree/538-convert-bst-to-greater-tree.md)
- [543     Diameter of Binary Tree](/oj-practices/chapter1/tree/543-diameter-of-binary-tree.md)
- [545     Boundary of Binary Tree](/oj-practices/chapter1/tree/545-boundary-of-binary-tree.md)
- [549     Binary Tree Longest Consecutive Sequence II](/oj-practices/chapter1/tree/549-binary-tree-longest-consecutive-sequence-ii.md)
- [563     Binary Tree Tilt](/oj-practices/chapter1/tree/563-binary-tree-tilt.md)
- [572     Subtree of Another Tree](/oj-practices/chapter1/tree/572-subtree-of-another-tree.md)
- [582     Kill Process](/oj-practices/chapter1/tree/582-kill-process.md)
- [606     Construct String from Binary Tree](/oj-practices/chapter1/tree/606-constructstring-from-binary-tree.md)
- [617     Merge Two Binary Trees](/oj-practices/chapter1/tree/617-merge-two-binary-trees.md)
- [623     Add One Row to Tree](/oj-practices/chapter1/tree/623-add-one-row-totree.md)
- [637     Average of Levels in Binary Tree](/oj-practices/chapter1/tree/637-average-of-levels-in-binary-tree.md)
- [652     Find Duplicate Subtrees](/oj-practices/chapter1/tree/652-find-duplicate-subtrees.md)
- [653     Two Sum IV - Input is a BST](/oj-practices/chapter1/tree/653-two-sum-iv-input-is-a-bst.md)
- [654     Maximum Binary Tree](/oj-practices/chapter1/tree/654-maximum-binary-tree.md)
- [655     Print Binary Tree](/oj-practices/chapter1/tree/655-print-binary-tree.md)
- [662     Maximum Width of Binary Tree](/oj-practices/chapter1/tree/662-maximum-width-of-binary-tree.md)
- [663     Equal Tree Partition](/oj-practices/chapter1/tree/663-equal-tree-partition.md)
- [666     Path Sum IV](/oj-practices/chapter1/tree/666-path-sum-iv.md)
- [669     Trim a Binary Search Tree](/oj-practices/chapter1/tree/669-trim-a-binary-search-tree.md)
- [671     Second Minimum Node In a Binary Tree](/oj-practices/chapter1/tree/671-second-minimum-node-in-a-binary-tree.md)
- [687     Longest Univalue Path](/oj-practices/chapter1/tree/687-longest-univalue-path.md)
- [742     Closest Leaf in a Binary Tree](/oj-practices/chapter1/tree/742-closest-leaf-in-a-binary-tree.md)
- [814     Binary Tree Pruning](/oj-practices/chapter1/tree/814-binary-tree-pruning.md)
- [834 Sum of Distances in Tree](/oj-practices/chapter1/tree/834-sum-of-distances-in-tree.md)
