Interested to Buy Any Domain ? << Click Here >> for more details...
Derive the complexity expression for AVL tree?
- 1 Answers
- 4188 Views
- I also Faced
- E-Mail Answers
Answer / bipworld
height of AVL tree is limited to 1.44 log(n) where n is
number of nodes.
| Is This Answer Correct ? | 3 Yes | 1 No |
Derive the complexity expression for AVL tree?
Write a function that accepts two numbers,say a and b and makes bth bit of a to 0.No other bits of a should get changed.
2 Answers Scientific Atlanta, Wipro,
How many types of sorting are there in c?
what is the difference between structural,object based,object orientd programming languages?
what is the size of an integer variable?
What is a pointer value and address in c?
What is a function simple definition?
main() { int i; printf("%d",i^i); }
how to add two numbers without using arithmetic operators?
where do we use structure pointer?
When should a type cast not be used?
How would you print out the data in a binary tree, level by level, starting at the top?
C 
