Citadel Logo

Citadel - Binary Tree

Binary Tree questions asked by Citadel

Total: 9
Easy: 0
Medium: 7
Hard: 2
Progress: 0%
No. Question Title Link Difficulty Solved
1 Minimum Equal Sum of Two Arrays After Replacing Zeros Visit Medium
2 Serialize and Deserialize Binary Tree Visit Hard
3 Inorder Successor in BST Visit Medium
4 Binary Tree Right Side View Visit Medium
5 Binary Tree Maximum Path Sum Visit Hard
6 Restricted Restricted Hard
7 Restricted Restricted Hard
8 Restricted Restricted Hard
9 Restricted Restricted Hard
10 Restricted Restricted Hard
11 Restricted Restricted Hard
12 Restricted Restricted Hard
13 Restricted Restricted Hard
14 Restricted Restricted Hard
15 Restricted Restricted Hard

Log in to access all 9 questions for free!

Log In

Frequently Asked Questions

Common questions about Citadel interviews