Binary heap why not ternary heap?

#1

i understood the no. of comparison are large in the ternar but the time compexity is less.
for example - log with base 3 of 1000 is 6.6approx
and logbase2of 1000 is 9.9 which is much greator in comparizon.

#2

@guptarahul3100 see the no of comparison in binary search is just one but in case of ternary it’s 3 . So for each turn you are adding a constant value of three for ternary. Which finally increase the time complexity of ternary search.

#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.