tree depth first search Problems

Patterns

7 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	All Paths for a Sum (medium) binary tree depth-first search recursion +2 more	56.9%	Med.
3	Problem Challenge 1: Tree Diameter (medium) binary tree tree depth first search recursion +1 more	59.2%	Med.
4	Problem Challenge 2: Path with Maximum Sum (hard) binary tree tree depth first search recursion +2 more	17.7%	hard
5	Validate Binary Search Tree (medium) binary search tree recursion binary tree +1 more	28.3%	Med.
6	Construct Binary Tree from Preorder and Inorder Traversal (medium) binary tree binary search tree recursion +4 more	52.8%	Med.
7	Serialize and Deserialize Binary Tree (hard) serialize and deserialize binary tree recursion +2 more	69.1%	hard