Python3 || 79 ms, faster than 93.12% of Python3 || Clean and Easy to Understand
\ndef insert(self, intervals: List[List[int]], newInterval: List[int]) -> List[List[int]]:\n        result = []\n        for i in range(len(intervals)):\n      
```\ndef insert(self, intervals: List[List[int]], newInterval: List[int]) -> List[List[int]]:\n        result = []\n        for i in range(len(intervals)):\n            if newInterval[1] < intervals[i][0]:\n                result.append(newInterval)\n                return result + intervals[i:]\n            elif newInterval[0] > intervals[i][1]:\n                result.append(intervals[i])\n            else:\n                newInterval = [min(newInterval[0], intervals[i][0]), max(newInterval[1], intervals[i][1])]\n        result.append(newInterval)\n        return result\n```
['Binary Tree', 'Python', 'Python3']