binary tree Problems | Design Gurus

Data Structures

binary tree

32 problems

#	Title	Acceptance	Difficulty
1	Reverse Level Order Traversal (easy) breadth-first search binary tree queue +1 more	89.2%	easy
2	Find Largest Value in Each Tree Row (medium) tree breadth first search binary tree breadth-first search +2 more	90.5%	Med.
3	Maximum Width of Binary Tree (medium) binary tree breadth-first search tree depth first search +3 more	32.1%	Med.
4	Maximum Level Sum of a Binary Tree (medium) breadth-first search binary tree level order traversal +1 more	54.0%	Med.
5	Zigzag Traversal (medium) binary tree breadth-first search level order traversal +3 more	64.1%	Med.
6	Even Odd Tree (medium) binary tree tree breadth first search level order traversal +2 more	56.9%	Med.
7	Binary Tree Level Order Traversal (easy) breadth-first search binary tree level order traversal +1 more	73.4%	easy
8	Reverse Level Order Traversal (easy) breadth-first search binary tree queue +1 more	89.2%	easy
9	Zigzag Traversal (medium) binary tree breadth-first search level order traversal +3 more	64.1%	Med.
10	Level Averages in a Binary Tree (easy) binary tree breadth-first search level order traversal +1 more	82.0%	easy
11	Minimum Depth of a Binary Tree (easy) binary tree breadth-first search depth-first search +1 more	21.5%	easy
12	Level Order Successor (easy) breadth-first search level order traversal binary tree +1 more	63.9%	easy
13	Connect Level Order Siblings (medium) breadth-first search binary tree level order traversal +1 more	78.1%	Med.
14	Problem Challenge 1: Connect All Level Order Siblings (medium) breadth-first search level order traversal binary tree +1 more	80.1%	Med.
15	Problem Challenge 2: Right View of a Binary Tree (easy) binary tree tree breadth first search level order traversal +1 more	76.3%	easy
16	Binary Tree Path Sum (easy) binary tree depth-first search recursion +1 more	38.3%	easy
17	All Paths for a Sum (medium) binary tree depth-first search recursion +2 more	56.9%	Med.
18	Sum of Path Numbers (medium) binary tree recursion depth-first search	69.0%	Med.
19	Path With Given Sequence (medium) binary tree recursion depth-first search +1 more	25.9%	Med.
20	Count Paths for a Sum (medium) binary tree depth-first search recursion +2 more	24.5%	Med.
21	Problem Challenge 1: Tree Diameter (medium) binary tree tree depth first search recursion +1 more	59.2%	Med.
22	Problem Challenge 2: Path with Maximum Sum (hard) binary tree tree depth first search recursion +2 more	17.7%	hard
23	Problem Challenge 2: Structurally Unique Binary Search Trees (hard) binary search tree binary tree recursion +2 more	30.1%	hard
24	Problem Challenge 3: Count of Structurally Unique Binary Search Trees (hard) binary search tree dynamic programming recursion +2 more	34.4%	hard
25	Same Tree (medium) binary tree binary search tree recursion +2 more	47.1%	Med.
26	Invert Binary Tree (medium) binary tree recursion depth-first search +1 more	77.7%	Med.
27	Binary Search Tree Iterator (medium) binary search tree recursion breadth-first search +2 more	90.0%	Med.
28	Subtree of Another Tree (easy) binary tree recursion breadth-first search +2 more	35.4%	easy
29	Validate Binary Search Tree (medium) binary search tree recursion binary tree +1 more	28.3%	Med.
30	Construct Binary Tree from Preorder and Inorder Traversal (medium) binary tree binary search tree recursion +4 more	52.7%	Med.
31	Lowest Common Ancestor of a Binary Search Tree (medium) binary search tree binary tree recursion +1 more	37.5%	Med.
32	Serialize and Deserialize Binary Tree (hard) serialize and deserialize binary tree recursion +2 more	69.0%	hard