[LeetCode] 700. Search in a Binary Search Tree(Kotlin)

[LeetCode] 700. Search in a Binary Search Tree(Kotlin)

• https://leetcode.com/problems/search-in-a-binary-search-tree/

풀이

/**
 * 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
 * }
 */
class Solution {
    fun searchBST(root: TreeNode?, `val`: Int): TreeNode? {
        if(root == null) return null
        if(root.`val` == `val`) return root
        
        //binary search
        return if(root.`val` > `val`) searchBST(root.left, `val`) else searchBST(root.right, `val`)
    }
}