binary tree Problems | Design Gurus

Data Structures

binary tree

29 problems

#	Title	Acceptance	Difficulty
1	Binary Tree Level Order Traversal (easy) breadth-first search binary tree level order traversal +1 more	73.5%	easy
2	Reverse Level Order Traversal (easy) breadth-first search binary tree queue +1 more	89.2%	easy
3	Zigzag Traversal (medium) binary tree breadth-first search level order traversal +3 more	64.1%	Med.
4	Level Averages in a Binary Tree (easy) binary tree breadth-first search level order traversal +1 more	82.1%	easy
5	Find Largest Value in Each Tree Row (medium) breadth-first search binary tree queue +1 more	90.5%	Med.
6	Maximum Level Sum of a Binary Tree (medium) binary tree breadth-first search level order traversal	54.0%	Med.
7	Even Odd Tree (medium) binary tree tree breadth first search level order traversal +2 more	56.9%	Med.
8	Minimum Depth of a Binary Tree (easy) binary tree breadth-first search depth-first search +1 more	21.6%	easy
9	Level Order Successor (easy) breadth-first search level order traversal graph algorithms +1 more	64.0%	easy
10	Connect Level Order Siblings (medium) breadth-first search binary tree level order traversal +1 more	78.1%	Med.
11	Maximum Width of Binary Tree (medium) binary tree breadth-first search tree depth first search +3 more	32.1%	Med.
12	Problem Challenge 1: Connect All Level Order Siblings (medium) breadth-first search level order traversal binary tree +1 more	80.1%	Med.
13	Problem Challenge 2: Right View of a Binary Tree (easy) binary tree tree breadth first search level order traversal +1 more	76.3%	easy
14	Binary Tree Path Sum (easy) binary tree depth-first search recursion	38.4%	easy
15	All Paths for a Sum (medium) binary tree recursion depth-first search	57.0%	Med.
16	Sum of Path Numbers (medium) binary tree recursion depth-first search	69.0%	Med.
17	Path With Given Sequence (medium) binary tree recursion depth-first search +1 more	26.0%	Med.
18	Count Paths for a Sum (medium) binary tree recursion depth-first search +2 more	24.6%	Med.
19	Problem Challenge 1: Tree Diameter (medium) binary tree graph algorithms recursion +2 more	59.3%	Med.
20	Problem Challenge 2: Path with Maximum Sum (hard) binary tree graph algorithms recursion +1 more	17.8%	hard
21	Problem Challenge 2: Structurally Unique Binary Search Trees (hard) binary tree binary search tree recursion +2 more	30.1%	hard
22	Same Tree (medium) binary tree binary search tree recursion +2 more	47.2%	Med.
23	Invert Binary Tree (medium) binary tree recursion tree depth first search +1 more	77.7%	Med.
24	Binary Search Tree Iterator (medium) binary search tree recursion breadth-first search +2 more	89.7%	Med.
25	Subtree of Another Tree (easy) binary tree recursion breadth-first search +2 more	35.5%	easy
26	Validate Binary Search Tree (medium) binary tree binary search tree recursion +1 more	28.3%	Med.
27	Construct Binary Tree from Preorder and Inorder Traversal (medium) binary tree binary search tree recursion +4 more	52.7%	Med.
28	Lowest Common Ancestor of a Binary Search Tree (medium) binary search tree binary tree recursion +1 more	37.5%	Med.
29	Serialize and Deserialize Binary Tree (hard) serialize and deserialize binary tree recursion +2 more	68.9%	hard