LeetCode 700. Search in a Binary Search Tree with Python

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

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def searchBST(self, root: Optional[TreeNode], val: int) -> Optional[TreeNode]:
        answer = []
        def dfs(node, val):
            if node.val == val:
                answer.append(node)

            elif node.val > val and node.left:
                dfs(node.left, val)

            elif node.val < val and node.right:
                dfs(node.right, val)

        dfs(root, val)
        return answer[0] if answer else None

얘 또한 이진 탐색 트리여서 찾는 값보다 크면 왼쪽을 뒤지고 찾는 값보다 작으면 오른쪽을 뒤지는 코드이다!