Question d’entretien chez InsuranceDekho

- Delete given node in LinkedList - Implement insert() delete() find() getRandom() in O(1) - Clone a Binary tree with Random Pointer - Design a DataStructure with Operations Push() Pop() Peak() PopMax() All operations must be less than O(n)