0 0 votes Which of the data structures supports both insertion of unique elements (no duplicates allowed) and deletion of the minimum element in $\mathrm{O}(\log n)$ time complexity? IIITH-PGEE iiith-pgee2026-cs-memorybased goclasses data-structures one-mark + – GO Classes 81 views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
0 0 votes Answer: Balanced BST GO Classes answered May 8 GO Classes comment Share Follow See 1 comment 1 1 comment reply akash_kumar 9 commented May 9 reply Follow flag can we say ordered set ? @GO Classes? 0 0 replyShare Please log in or register to add a comment.