Computer Science, asked by Kirtk4549, 10 months ago

Max no of nodes in binary tree with height k, where root height is 0

Answers

Answered by Anonymous

1

Explanation:

Binary search tree whose left and right subtrees differ in height by at most 1 unit is called

Answered by kanika575

0

Answer:

In which left and right subtrees differ by 1 unit

Previous Question

Next Question

Similar questions

English, 5 months ago

what is the first things you do after you get up...

Computer Science, 5 months ago

write a java program to show the usage of instance and local variable...

English, 5 months ago

animals also have right to live...

Social Sciences, 10 months ago

Short-Answer Questions 1. Who is the Chief Justice of the High Court of your State? 2. Who appoints the Chief Justice of a High Court? 3. Mention two qualifications necessary for a person to be appointed as a judge of a High 4. What are the qualifications required to become the judge of a High Court? 5. How can a judge of the High Court be removed from his post? 6. Name one Union Territory which...

Social Sciences, 10 months ago

what is marketable surplus ...

Chemistry, 1 year ago

Arrange in increasing order of atomic radius b,al,ga,in,tl...

Physics, 1 year ago

A quantity is measured in -30m/s .Is it speed or velocity...

Geography, 1 year ago

Ardhnarishwar temple' is located in which district of himachal pradesh...