0112-path-sum.kt

/**
 * Example:
 * var ti = TreeNode(5)
 * var v = ti.`val`
 * Definition for a binary tree node.
 * class TreeNode(var `val`: Int) {
 * var left: TreeNode? = null
 * var right: TreeNode? = null
 * }
*/
classSolution {
funhasPathSum(root:TreeNode?, targetSum:Int): Boolean {

 root?:returnfalse

if(root.left ==null&& root.right ==null) return targetSum - root.value ==0
elsereturn hasPathSum(root.left, targetSum - root.value) || hasPathSum(root.right, targetSum - root.value)
 }

valTreeNode.value get() =this.`val`
}