Please clear my doubt in this video

#1

as in this vedio you describe bt is best for heap implemtation as log2(n^2) <<<log3(n^3) then ternary tree but for n=10^15 i fonud log2(n^2)=99.64 and log3(n^3)=94.4 then tere is not much difference please correct me …

#2

@kailash_01 please watch the later videos of heap implemetation as well :blush:

#3

i could’t understand it please correct me if i am wrong…

#4

@kailash_01 hi i told you to watch the implementation video because heaps are actually implemented using an array not a binary tree. Binary tree is used for easy visualisation of a heap.

#5

but my doubt is not heap is impemented by tree or vector i just want to know if binary tree is best then ternary as log2(n^2) <<<log3(n^3 but value is not accourdance with it please help…

#6

@kailash_01 i am unable to understand your query can you please elaborate? or tell the timestamp in the video

#7

at 4:51 they are saying why we are using bt then ternary tree as log2(n^2) <<<log3(n^3) but for n=10^15 i fonud log2(n^2)=99.64 and log3(n^3)=94.4 then there is not much difference please correct me …

#8

@kailash_01 the difference is small but bt still has a better time complexity and the difference increases even further for really large values or if there are a lot of operations involved.

#9

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.