Yahoo Interview Question
178 Interview Reviews |
Back to all Yahoo Interview Questions & Reviews
Interview questions and reviews posted anonymously by interview candidates
Interview Question for Intern at Yahoo:
What is the largest possible number of internal nodes in a red-black tree with black-height k? What is the smallest possible number?
Helpful Question?
Yes |
No
Inappropriate?
Answers & Comments (0)
Members can
answer or comment on this question
–
Join Now (It's Free) or
Sign In