tree depth first search Problems

Patterns

6 problems

#	Title	Acceptance	Difficulty
1	Maximum Width of Binary Tree (medium) binary tree breadth-first search tree depth first search +3 more	32.1%	Med.
2	Path With Given Sequence (medium) binary tree recursion depth-first search +1 more	25.9%	Med.
3	Problem Challenge 3: Count of Structurally Unique Binary Search Trees (hard) binary search tree dynamic programming recursion +2 more	34.4%	hard
4	Invert Binary Tree (medium) binary tree recursion tree depth first search +1 more	77.6%	Med.
5	Construct Binary Tree from Preorder and Inorder Traversal (medium) binary tree binary search tree recursion +4 more	52.7%	Med.
6	Serialize and Deserialize Binary Tree (hard) serialize and deserialize binary tree recursion +2 more	68.9%	hard