[PYTHON] |  3 methods dfs and bfs and constant space method
\n\t\t\n\t\t"""\n        #dfs\n        def search(node):\n            if node==None:\n                return None\n            if node.val==val:\n              
\n\t\t\n\t\t"""\n        #dfs\n        def search(node):\n            if node==None:\n                return None\n            if node.val==val:\n                return node\n            if node.val>val:\n                return search(node.left)\n            return search(node.right)\n  \n        return search(root)\n\n        """\n        #bfs\n        q=deque([root])\n        while q:\n            node=q.popleft()\n            if node.val==val:\n                return node\n            if node.val>val:\n                if node.left:\n                    q.append(node.left)\n            else:\n                if node.right:\n                    q.append(node.right)\n        return None\n\t\t\n\t\t\n# \t\tconstant space solution\n\t\twhile root:\n            if root.val==val:\n                return root\n            if root.val>val:\n                root=root.left\n            else:\n                root=root.right\n        return None
['Depth-First Search', 'Breadth-First Search', 'Python']