Register

GO Classes DPP | PYTHON & DSA |LINKEDLIST

152 views

1 Answer

1 1 vote
In a singly linkedlist, random access is not possible That's why worst case searching leads to $O(n)$
Voting & Accepting an answer helps improve the community
Answer:
← Previous · GO Classes DPP | PYT...Next → · GO Classes DPP | PYT...
← Previous in category · GO Classes DPP | PYT...Next in category → · GO Classes DPP | PYT...
Position:
Show:

Related questions

0 0 votes
1 1 answer
242
242 views
GO Classes asked Feb 10
242 views
GO Classes DPP | PYTHON & DSA |CBT
In a complete binary tree with $n$ nodes, what is the maximum height of the tree? $($Assume height of a single-node tree is $0 )$.$\log _2(n+1)$ $\left\lfloor\log _2 n\ri...
0 0 votes
1 1 answer
180
180 views
GO Classes asked Feb 10
180 views
GO Classes DPP | PYTHON & DSA |BFS
Let $G$ be a connected undirected graph with $n$ vertices and $m$ edges. We perform a Breadth-First Search (BFS) starting from an arbitrary vertex $s$. Let $d(u)$ be the ...
1 1 vote
1 1 answer
185
185 views
GO Classes asked Feb 10
185 views
GO Classes DPP | PYTHON & DSA |STACK
A sequence of $n$ distinct elements is pushed onto a Stack in the order $1,2,3, \ldots, n$. While the elements are being pushed, an arbitrary number of $\verb|pop|$ opera...
0 0 votes
1 1 answer
159
159 views
GO Classes asked Feb 10
159 views
GO Classes DPP | PYTHON & DSA |BINARY TREE
Consider a Binary Search Tree (BST) $T$ containing $n$ distinct elements. Let the sequence of nodes visited during an In-order traversal be $I$ and the sequence of nodes ...