Path Sum 1 - Check if root to leaf path exists

easy Solve on LeetCode

Last edited: January 4, 2026

Related Tags

binary-tree bt-binary-tree leetcode

Continue Practicing

Binary Tree Path Sum - Find all paths between any two nodesMedium Binary Tree Path Sum - Maximum Sum Leaf to Root pathMedium Binary Tree Path Sum - Maximum between any two leavesMedium Binary Tree Path Sum - Maximum between any two nodesHard Binary Tree Path Sum - Minimum Sum Root to Leaf pathEasy Minimum Length Root to Leaf BST Path for Given SumMedium Minimum Length Root to Leaf Binary Tree Path for Given SumMedium Path Sum 2 - find all root to leaf pathsMedium Path Sum 3 - Count paths from parent to childMedium Path Sum IVMedium

Path Sum 1 - Check if root to leaf path exists - Coding Problem | K5kC