Python3 Sort and Binary Search Solution
\nclass Solution:\n    def asteroidsDestroyed(self, mass: int, asteroids: List[int]) -> bool:\n      asteroids.sort()\n      while asteroids:\n        ind = bis
```\nclass Solution:\n    def asteroidsDestroyed(self, mass: int, asteroids: List[int]) -> bool:\n      asteroids.sort()\n      while asteroids:\n        ind = bisect.bisect_right(asteroids, mass)\n        if ind == len(asteroids): return True\n        elif ind == 0: return False\n        else:\n          #it can collide with all asteroids before this index\n          mass += sum(asteroids[:ind])\n          asteroids = asteroids[ind:]\n```
['Binary Tree', 'Python3']