data structures

sarthak asked Aug 4, 2018

307 views

0 votes

A ds is reqd. For storing a set of integers such that each of the following operations can be done in O (logN) time where N is the no. Of elements in the set

Deletion of smallest element

Insertion of an element if it is not already present in the set

sarthak asked Aug 4, 2018

sarthak

307 views

See all

3 3 Comments

Shaik Masthan

commented Aug 4, 2018

Take min Heap, it will satisfy

1) Extraction in O(log N) ====> Due to extraction, we gen minimum element

2) Insertion in O(log N)

0 votes

sarthak

commented Aug 4, 2018

Can a balanced binary search tree be used?

0 votes

Shaik Masthan

commented Aug 4, 2018

Can a balanced binary search tree be used?

yes you can use it

0 votes

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Voting & Accepting an answer helps improve the community

← Previous Next →

← Previous in category Next in category →

Related questions

9 votes

2 answers

GO Classes asked May 4, 2022

510 views

GO Classes Weekly Quiz 9 | Data Structures | Linked List | Question: 8
If $f(n) = O(g(n))$ and $f(n) = \Omega(g(n)),$ then it is always true that $f(n) = o(g(n)).$ $f(n) = \theta(g(n)).$ $f(n) = \omega(g(n)).$ both A and B are always true.

If $f(n) = O(g(n))$ and $f(n) = \Omega(g(n)),$ then it is always true that$f(n) = o(g(n)).$$f(n) = \theta(g(n)).$$f(n) = \omega(g(n)).$both A and B are always true.

GO Classes

510 views

GO Classes asked May 4, 2022

Programming in C
goclasses_wq9
goclasses
algorithms
asymptotic-notation
1-mark

+ –

5 votes

2 answers

GO Classes asked May 4, 2022

567 views

GO Classes Weekly Quiz 9 | Data Structures | Linked List | Question: 12
Which of the following statement(s) is/are true? If $\text{T1}(x) = \text{O}(f(x))$ and $\text{T2}(x) = \text{O}(g(x))$ then $\text{T1}(x) + \text{T2}(x) = \text{O} (\max(f(x), g(x))$ If $\text{T}(x) = \text{O}(cf(x)),$ ... then $\text{T1}(x) \ast \text{T2}(x) = \text{O}(f(x) \ast g(x))$ $2^{(n+1)} = \text{O}(2^{n} ).$

Which of the following statement(s) is/are true?If $\text{T1}(x) = \text{O}(f(x))$ and $\text{T2}(x) = \text{O}(g(x))$ then $\text{T1}(x) + \text{T2}(x) = \text{O} (\max(...

GO Classes

567 views

GO Classes asked May 4, 2022

Programming in C
goclasses_wq9
goclasses
algorithms
asymptotic-notation
multiple-selects
2-marks

+ –

7 votes

2 answers

GO Classes asked May 4, 2022

1,552 views

GO Classes Weekly Quiz 9 | Data Structures | Linked List | Question: 13
Consider two statements below - $\text{S1}:$ For all positive $f(n), f(n) + o(f(n)) = \theta(f(n)).$ $\text{S2}:$ For all positive $f(n), g(n)$ and $h(n),$ if $f(n) = O(g(n))$ ... $\text{S1}$ is True but $\text{S2}$ is False. $\text{S2}$ is True but $\text{S1}$ is False. Both are True. Both are False.

Consider two statements below -$\text{S1}:$ For all positive $f(n), f(n) + o(f(n)) = \theta(f(n)).$$\text{S2}:$ For all positive $f(n), g(n)$ and $h(n),$ if $f(n) = O(g(n...

GO Classes

1.6k views

GO Classes asked May 4, 2022

Programming in C
goclasses_wq9
goclasses
algorithms
asymptotic-notation
2-marks

+ –

7 votes

2 answers

GO Classes asked May 4, 2022

860 views

GO Classes Weekly Quiz 9 | Data Structures | Linked List | Question: 14
Which of the following(s) is/are true? If $f(n) = O(n^2)$ then $f(n) = O(n).$ If $f(n)$ is $O(3^{\log_{10}n}),$ then $f(n)$ is $O(n^2).$ The function $f(n) = \lg(n!) = O(n \lg n).$ Growth of the sum $1 + \frac{1}{2} + \frac{1}{3} + \dots + \frac{1}{n}$ can be described by $\theta(\log n).$

Which of the following(s) is/are true?If $f(n) = O(n^2)$ then $f(n) = O(n).$If $f(n)$ is $O(3^{\log_{10}n}),$ then $f(n)$ is $O(n^2).$The function $f(n) = \lg(n!) = O(n \...

GO Classes

860 views

GO Classes asked May 4, 2022

Programming in C
goclasses_wq9
goclasses
algorithms
asymptotic-notation
multiple-selects
2-marks

+ –

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

3 3 Comments reply

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Related questions

3 3 Comments