Computer Science, asked by zajeeshz3501, 1 year ago

The minimum height of a binary search tree containing n nodes is

Answers

Answered by rk45125833k4

0

If there are n nodes in binary tree, maximum height of the binary tree is n-1 and minimum height is floor(log2n).

Previous Question

Next Question

Similar questions

English, 6 months ago

Change the voice : I am watching a movie .

Hindi, 6 months ago

pls anwer this questions...

English, 6 months ago

Which country has the highest number of world Heritage Sites?

Social Sciences, 1 year ago

The middle classes played an important role in the non-cooperation movement in the cities. Explain. Why do you think that the movement slowed down in the cities?

Computer Science, 1 year ago

The memory unit that communicates directly with the cpu is called...

Math, 1 year ago

How many dimensions a solid has?

Math, 1 year ago

Why is x used in majority in maths?

Math, 1 year ago

the bisector of angle of B and angle of C of a triangle ABC meet at O, show that angle BOC = 90° + angle of A/2...