given a height balanced tree. If we add one more node , how
many nodes gets unbalanced ?
Answer Posted / banti sharma
The answer given above is wrong. The exact answer is (log n)
wherw n is the no. of nodes in binary tree
| Is This Answer Correct ? | 4 Yes | 1 No |
Post New Answer View All Answers
Given an array of size n, containing every element from 1 to n+1, except one. Find the missing element.
Difference of Console, web & windows applications?
What is the difference beween joblib and steplib statements
Write a program to show polymorphism.
Write a program to find duplicate number from array in minimum time complexity.
what is web configuration file
how does database connection using ADO.NET?
Write a program to reverse a number?
how do i create my own exception class which will restrict IO exception?
iam confused among testing ,.net and java. can anybody help me.
What is the merger sort principle and its time complexity.
Give examples of macro quoting function?
Where do we need Operator overloading?
how to fin top two miximum values in sql? not 2nd both max value of 1st and 2nd both have to find out
How to create a new dataset only duplicate observations in proc sort procedure?