Question about heap sorting algorithm

Question

I am looking at a heap sorting algorithm . I am wondering why this is implemented in a binary tree? Can this use another tree? For example, a tree with three children - node? Or four? With a large number of children, although a little more is required for the removal operation . tree height may be less. I believe that the cost of time should be significantly compared to the binary tree implementation.

Answer 1

Wikipedia also shows the difference in cost - only 12%. The height of the tree should decrease depending on log (3) / log (2) ~ = 1.5

. , heapsort satysfying, . .

Answer 2

, , .