Doubt regarding why heap trees are binary not ternary

#1

as explained in the video ,for down heapification t(n) is 1+2log(n)base 2 for ternary it would be 1+3log(n)base 3.
but 3log(n)base 3 wud be smaller than 2log(n)base 2

#2

@015itachiuchiha hey actually ye heap ki 2 properties hai:
It should be complete binary tree and heap order property must be satisfied that parent is always greater than children in case of max heap and smaller for min heap.

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.