The space complexity is O(n) due to the recursion stack in the worst case when the tree is skewed.

BFS visits each vertex and edge once, leading to a time complexity of O(V + E), where V is vertices and E is edges.

Inserting an element into a binary heap takes O(log n) time due to the need to maintain the heap property.

Bubble sort has a worst-case time complexity of O(n^2) due to the nested loops.

The average case time complexity of quicksort is O(n log n) due to the divide and conquer approach.