[Leetcode] DFS problems

Letter Combinations of a Phone Number	3	3	string	dfs
Generate Parentheses	3	4	string	dfs
Sudoku Solver	4	2	array	dfs
N-Queens	4	3	array	dfs
N-Queens II	4	3	array	dfs
Word Search	3	4	array	dfs
Restore IP Addresses	3	3	string	dfs
Unique Binary Search Trees II	4	1	tree	dp dfs
Validate Binary Search Tree	3	5	tree	dfs
Recover Binary Search Tree	4	2	tree	dfs
Same Tree	1	1	tree	dfs
Symmetric Tree	1	2	tree	dfs
Maximum Depth of Binary Tree	1	1	tree	dfs
Construct Binary Tree from Preorder and Inorder Tr	3	3	array tree	dfs
Construct Binary Tree from Inorder and Postorder T	3	3	array tree	dfs
Convert Sorted Array to Binary Search Tree	2	3	tree	dfs
Balanced Binary Tree	1	2	tree	dfs
Minimum Depth of Binary Tree	1	1	tree	dfs
Path Sum	1	3	tree	dfs
Path Sum II	2	2	tree	dfs
Populating Next Right Pointers in Each Node	3	3	tree	dfs
Populating Next Right Pointers in Each Node II	4	2	tree	dfs
Binary Tree Maximum Path Sum	4	2	tree	dfs
Sum Root to Leaf Numbers	2	4	tree	dfs
Surrounded Regions	4	3	array	bfs dfs
Palindrome Partitioning	3	4	string	dfs