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

Question

Accepted Answer

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 a preprocessor method that builds the hash table for quick access to B nodes.
Data structures like arrays and hash tables have constant time complexity for accessing elements by index.
Example: Store B node positions in a hash table and use it to quickly find the 3rd B at a given index.