Skip to content
Skills
Problems
Questions
Roles
Skills
Interview
Contest
Leaderboard
More
Problems
Questions
Roles
Skills
Interview
Contest
Leaderboard
More
Home
/
Backend Developer
/
Questions
/
Binary Trees
Backend Developer
Binary Trees questions
12 questions on Binary Trees for backend developers, easiest first.
Easy
5
Most nodes in a binary tree of height 3
easy
Leaves in a full binary tree
easy
Recursive maximum depth of a tree
easy
Child positions in an array-based tree
easy
Complete binary tree meaning
easy
Medium
3
Where the tree diameter can be
medium
Bug in a root-to-leaf path sum
medium
Checking if a tree is a mirror of itself
medium
Hard
4
Maximum path sum with negative values
hard
LCA in a tree without BST order
hard
Counting nodes of a complete tree quickly
hard
Flattening a tree into a list in place
hard
