Bounteous - Accolite Campus Hiring Challenge 2025 | Festival of Spirits | Inorder Traversal

Problem 1 - Festival of Spirits Problem Statement You are given N sacred sites numbered from 0 to N-1, connected as a complete binary tree rooted at site 0. The tree is formed level by level from left to right. For any site i: its left child is at index 2i + 1 its right child is at index 2i + 2 (only if these indices are within range 0 to N-1). Each site i is guarded by guardians[i] guardians. ...