Does the default min() method in python uses heap binary tree implementation to find the minimum value in a list?

Question

Hi so i have a list u = [2,45,0,56,78,13].

We can use min() method to find the minimum value in a list. I was going through the heap binary tree.

The python has a module heapq and there is a method heapq.nsmallest() which helps to find the n smallest number in a heap binary tree.

Does the default min() method in python use the heap binary tree to find the minimum value in the list?