1 Given a n-ary tree. Devise an algo which determines the position at which the 3rd B is present from the given index in constant time complexity. Try it for binary tree. What is hashing. What is constant time complexity? Which are the data structures which have constant time complexity. HINT - they both use indexes? The preprocessor method will use what data structures to ensure the getA() or getB() function will determine the 3rd B's position in constant time complexity

AnswerBot
5mo
Algorithm to find 3rd B in n-ary tree at given index in constant time complexity using hashing and indexes.
Use hashing to store the positions of B nodes in the tree for constant time lookup.
Implement ...read more
Help your peers!
Add answer anonymously...
Stay ahead in your career. Get AmbitionBox app


Trusted by over 1.5 Crore job seekers to find their right fit company
80 L+
Reviews
10L+
Interviews
4 Cr+
Salaries
1.5 Cr+
Users
Contribute to help millions
AmbitionBox Awards
Get AmbitionBox app

