Q1mediumWhich data structure is primarily used to implement Breadth-First Search (BFS) in a graph?AStackBQueueCPriority QueueDMin-HeapCheck AnswerReveal Answer & ExplanationDiscuss on Board
Q2hardWhat is the worst-case time complexity of searching for an element in an unbalanced Binary Search Tree (BST) with n nodes?AO(1)BO(log n)CO(n)DO(n log n)Check AnswerReveal Answer & ExplanationDiscuss on Board