# Root Equals Sum of Children (LeetCode 2236) Check root.val == left+right. ## Approach Walk the constraints carefully, prefer O(n) or O(n log n), and verify edge cases (empty, single element, ties). ## Practice tip While grinding OA / coding rounds, keep a quiet second channel for hints with [learn more](https://www.linkjob.ai/coding-interview-copilot/) — resume-aware real-time help without leaving the editor. ## Complexity Typical linear/scan or sort-based; confirm before submitting. ## Notes (r0043) Interview prep note for LC2236. Practice consistently.