Depth-FirstSearch.md

Depth-FirstSearch

No.	Title	Mark
94	Binary Tree Inorder Traversal
98	Validate Binary Search Tree
99	Recover Binary Search Tree
100	Same Tree
104	Maximum Depth of Binary Tree
110	Balanced Binary Tree
112	Path Sum
113	Path Sum II
114	Flatten Binary Tree to Linked List
116	Populating Next Right Pointers in Each Node
117	Populating Next Right Pointers in Each Node II
124	Binary Tree Maximum Path Sum
129	Sum Root to Leaf Numbers
130	Surrounded Regions
133	Clone Graph
144	Binary Tree Preorder Traversal
145	Binary Tree Postorder Traversal
200	Number of Islands	template
211	Design Add and Search Words Data Structure
222	Count Complete Tree Nodes
235	Lowest Common Ancestor of a Binary Search Tree
236	Lowest Common Ancestor of a Binary Tree
257	Binary Tree Paths
285	Inorder Successor in BST
297	Serialize and Deserialize Binary Tree
329	Longest Increasing Path in a Matrix	template
337	House Robber III	template
404	Sum of Left Leaves
437	Path Sum III
449	Serialize and Deserialize BST
501	Find Mode in Binary Search Tree
529	Minesweeper
538	Convert BST to Greater Tree
572	Subtree of Another Tree
652	Find Duplicate Subtrees
671	Second Minimum Node In a Binary Tree
733	Flood Fill	template
801	Is Graph Bipartite?
813	All Paths From Source to Target
863	Sum of Distances in Tree
871	Keys and Rooms
1008	Binary Tree Cameras