Q-1 What Is A Null Pointer?

A null pointer is a special pointer value that is known not to point anywhere. It means that no
other valid pointer, to any other variable or array cell or anything else, will ever compare
equal to a null pointer.

Q-2 What do you mean by an Array?

Array is a set of similar data types.
Array objects store multiple variables with the same type.
It can hold primitive types and object references.
Arrays are always fixed.

Q))
** Advantages and disadvantages of Array?
Advantages: We can put in place of other data structures like stacks, queues, linked lists,
trees, graphs, etc. in Array. Arrays can sort multiple elements at a time. We can access an
element of Array by using an index.
Disadvantages: We have to declare Size of an array in advance. However, we may not
know what size we need at the time of array declaration. The array is a static structure. It
means array size is always fixed, so we cannot increase or decrease memory allocation.

Q-3. Can we change the size of an array at run time?

No, we cannot change the array size. Though there are similar data types available which
allow a change in size.

Q-4 What are Singly Linked Lists?

In a singly linked list, each node stores a reference to an object that is an element of the
sequence, as well as a reference to the next node of the list. It does not store any pointer or
reference to the previous node. To store a single linked list, only the reference or pointer to
the first node in that list must be stored. The last node in a single linked list points to nothing.

Q-5 Explain Doubly Linked Lists?

A doubly linked list is a data structure that consists of a set of sequentially linked records
called nodes. Each node contains three fields: two link fields (references to the previous and
to the next node in the sequence of nodes) and one data field.

Ternary Tree:- General trees which have 3 sub-trees per node are called ternary trees

IT B QUESTIONSs
1. Basic theory questions he puche the

2. What is tree data structure

 A tree data structure can be defined recursively as a collection of nodes,
where each node is a data structure consisting of a value and a list of
references to nodes.

3. What is hashing

Hashing is an important data structure designed to solve the problem of

efficiently finding and storing data in an array.

4. Circular linked list

A circular linked list is a variation of a linked list in which the last node
points to the first node, completing a full circle of nodes.

5. Time complexity of linked list avg case,tree

Worst case:
 6. Stack

Stack is a linear data structure which follows a particular order in which

the operations are performed. The order may be LIFO(Last In First Out) or
FILO(First In Last Out).

7. Queue

A Queue is a linear structure which follows a particular order in which

the operations are performed. The order is Last in first out.

8. Doubly LL

Doubly linked list is a complex type of linked list in which a node contains a
pointer to the previous as well as the next node in the sequence.

9. Linked list

Like arrays, Linked List is a linear data structure. Unlike arrays, linked list
elements are not stored at a contiguous location; the elements are linked
using pointers.
10. Time complexity of AVL tree

O(log2n).

11. Bst vs AVl

Binary Search tree AVL tree

Every binary search tree is a binary tree Every AVL tree is also a binary tree

because both the trees contain the because AVL tree also has the utmost

utmost two children. two children.

In BST, there is no term exists, such as In the AVL tree, each node contains a

balance factor. balance factor, and the value of the

balance factor must be either -1, 0, or 1.

Every Binary Search tree is not an AVL Every AVL tree is a binary search tree

tree because BST could be either a because the AVL tree follows the

balanced or an unbalanced tree. property of the BST.

Each node in the Binary Search tree Each node in the AVL tree consists of

consists of three fields, i.e., left subtree, four fields, i.e., left subtree, node value,

node value, and the right subtree. right subtree, and the balance factor.

12. BST KI TE
 13. Circular LL

Circular linked list is a linked list where all nodes are connected to form a
circle. There is no NULL at the end. A circular linked list can be a singly
circular linked list or doubly circular linked list.

14. Bst avg time - o(logn)

15. Avl avg time - o(log n)

16. Bst worst time - o(n)

17. Avl worst time - o(logn)

18. Bst or bt me time comp o of n ??

19. in AVL time comp is o of log base 2 n?? Correct me if i am wrong

20. full ,complete BT ,linked list , condition of stack overflow,circular queue, circular
link list

* 21. Bfs dfs

BFS DFS

Full form BFS stands for Breadth First DFS stands for Depth First Search.

Search.

Technique It is a vertex-based technique It is an edge-based technique because the vertices

to find the shortest path in a along the edge are explored first from the starting to

graph. the end node.

Kaise work karta hai

22. Quick sort

23. Double hashing

24. Kaun sa sort best hai and why – quick sort because iska average and best time
complexity O(n logn) hai.

25. Priority queue – A queue with priority(simple). Here the elements are not in FIFO
manner but according to the priority that is assigned to them.If the elements are in
the same priority ,only than the FIFO principle is followed

26. Tower of hanoi

The Tower of Hanoi, is a mathematical problem which consists of three rods and
multiple disks. Initially, all the disks are placed on one rod, one over the other in
ascending order of size similar to a cone-shaped tower.

27. Time complexity

28. What is an AVL tree ?

A balanced binary search tree where the height of the two subtrees (children)
of a node differs by at most one.

29. What is a tree ?

A tree is non-linear and a hierarchical data structure consisting of a collection

of nodes such that each node of the tree stores a value, a list of references to
nodes (the “children”).

30. What is BST ?

Binary Search Tree is a node-based binary tree data structure which has the
following properties:

- The left subtree of a node contains only nodes with keys lesser than the
node’s key.
- The right subtree of a node contains only nodes with keys greater than the -
node’s key.
- The left and right subtree each must also be a binary search tree.
- There must be no duplicate nodes.

31. How is AvL diff from BST ?

32. What is the time complexity of finding the minimum in a skewed tree ?

O(1) Best case happens for right skewed trees in finding the minimum value.

33. What is the time complexity of finding a minimum in AVL ?

O(log n) .

34. The Tower of Hanoi puzzle with n disks can be solved in minimum 2^n−1 steps.

35. Heap over stack ??

Stack is used for static memory allocation and Heap for dynamic memory
allocation, both stored in the computer's RAM

36. Quick sort ??

Quicksort is a divide-and-conquer algorithm. A sorting technique that sequences a

list by continuously dividing the list into two parts and moving the lower items
to one side and the higher items to the other.

37. Bst, one screen shared questions, linked list linear or nonlinear, doubly LL,tower
of hanoi ....3 palte hain to kitne number—- agar 3 disc he to 7 movement karegi* of
step honge tower of hanoi m

41. Time complexity of linked list worst case,tree

+ What is a full/strict binary tree ?

42. What is a complete binary tree ?

43. Double hashing

Double hashing is a technique used for avoiding collisions in hash tables.

44. Quadratic probing

Quadratic probing is an open addressing scheme in computer programming for

resolving hash collisions in hash tables.

45. double hashing me hf1()+i*hf2()%Size

hash1(key) = key%SIZE
hash2(key) = PRIME – (key % PRIME)

46. Data address for 2d array a[m][n] -> a[i][j]

Row Major

- Base address + (i * n + j) * (size of 1 element)

Column Major

- Address(a[i][j]) = ((j*m)+i)*Size + BA.

47. Stack memory

A stack is a special area of computer's memory which stores temporary variables

created by a function. Runtime initilize kar skte he variables ko

48. Queue using two stack

A queue can be implemented using two stacks. Let queue to be implemented be q

and stacks used to implement q be stack1 and stack2.

50. Complexity for binary search tree

51. B+ tree uses in database to access data easily

52. priority queue, b+tree ka application , binary tree to linked list

53. double hashing means that 2 hash functions are right??

54.H(x) = H1(x) + i*H2(x)

N dimensional array mein memory location

Stack storage kya hoti

Complexities alag alag sorting

*B+ tree application

Circular queue

Mere se

Quick sort complexity

Circular queue

*B and B+ tree
+1

Merge sort bhi tha

Why avl tree

Complexity

Full and complete bt

B+ tree

Bt bnava liya tha

2 logon se

Quicksort worst case

Avl tree

Why avl need in binary tree

Time complexity of avl/quick in different cases

Link list

Doubly linked list

AVL tree

Stack

Time complexity of BST

Priority queue

Circular queue

Linked list*

Circular linked list

Forest tree

What is Tower of Hanoi

Time Complexity of Tower of Hanoi

What is B Tree

What is B+ Tree

*What is a Threaded Tree? (God Knows)

What is a right skewed Binary Tree?

Time Complexity of Finding First and Last element in a Right Skewed Binary Tree?
[O(1) and O(n) respectively]

Time Complexity of Linked List [O(n)]

If both Linked list and Binary tree have the same complexity... What's the difference?

Why Avl tree is better than Bst

Avl tree ka complexity

Skew tree kuch tha

Circular linked list

Traversing of tree

Real life application of queues

Binary tree ki complexity.

Avl tree

How will queue be implemented using linked list

Circular queue

Circular ll

Complexity avl

Difference bw array and linked list

Why we required hashing

Array or linked list mai difference

What is selection sort n it's time complexity?

What is bubble sort and it's time complexity?

Define a complete binary tree.

In 2D array ,row major n column major formula.

Stack overflow condition.

Create a binary tree n find the preorder, inorder n postorder

Complexity of binary search

Priority queue

Quicksort worst time complexity

Stack internal memory representation

B+ tree and applications

What is stack memory

Priority queue

AVL trees

Stack using ll and array which is better

Data structures

Quick sort worst complexity

CS A LAB

1. Minimum spanning tree

2. Overflow condition
3. Circular que why
4. What is stack
5. Linked list or array better for stack
6. Binary tree ,full tree,complete tree definitions
7. Height of complete tree
8. No of nodes of complete tree of height h
9. Priority queue
10. Tower of hanoi

Time complexity=2^n, function call= 2^n -1

11. Avl rotations

12. Avl complexity - O(logn)
13. Balance factor(left subtree height-right subtree height)
14. Why we use AVL tree (because it is a balance BST so we are done all
operation in O(logn) time)
15. Number of comparison in insertion sort
16. Complexity of insertion sort
17. Data structure used for DFS
18. how linked list is better than array
19. What is b+ tree
20. Applications of b+ tree
21. What is the difference between linear and non linear data structure
22. tree vs graph, connected graph and disconnected graph, applications of
graph, define bubble sort, heap data structure
23. What is forest tree
24. What is tournament tree (idk what he asked i guess he told tournament,not
sure)
25. complexity of quick sort in worst case
26. \When does it occur (reference to Q3.)
27. What is adjacency matrix
28. Application of stack in real life
29. Hashing
30. What is heap
31. Queue overflow
32. Adjacency matrix
33. Adjacency list
34. Strictly binary tree
35. Non linear data structure
36. Full or strict Binary tree:- non terminal or internal node should have 2 children
37. Perfect Binary tree:- every node should have 2 child except leaf node such
that they are on same on level
38. Complete Binary tree:-all levels should be completely filled except last level
and last level should have keys as left as possible
39. What is forest tree
40. What is graph
41. Dfs and bfs memory management
42. Difference between connected and disconnected graph
43. Difference between array and linked list
44. Disadvantage of linked list
45. Dfs and bfs
46. Spanning of trees
47. Diff bw stack and queue
48. Overflow condition in queue
49. Best of binary search
50. What is radix sort
51. If we have huge data in disc which sort to use
52. Answer is merge but why puche...
53. What is graph
54. What is graph data structure?
55. What is complete graph
56. Difference between graph and tree
57. How to traverse in graph//
58. What is forest tree
59. What is level in a tree
60. What is a perfect binary tree
61. What is b+ tree
62. Applications of b+ tree
63. Why we study data structures
64. What is quick sort
65. How is linked list different than array
66. How to add node in circular linked list
67. Tree traversal draw and explain
68. Complete binary tree
69. Stack memory
70. Forest tree
71. Application of stack
72. Priority queue
73. Tower of Hanoi

🥲
74. bas itna
75. Uske bad sir ka network issue hua, then bole okk your viba completed
76. Insertion sort complexity
77. Graph ka application, graph ka facebook mein use,
78. What is graph
79. Complete binary tree
80. Graph representation (notebook pe graph banane ko bola aur uska adjacency
matrix aur list banao)
81. How to implement tree DS?
82. Tower of Hanoi
83. Stack memory.
84. After deleting the stack element ka kya hota hai? Koi existence rahti Hai?
85. What's hashing?
86. Stack memory
87. how do we balance avl tree
88. what is circular linked list
89. how to insert an element in the middle in circular linked list
90. time complexity of avl tree
91. tower of Hanoi
92. Difference between graph and tree
93. What is queue
94. Overflow condition
95. Circular queue
96. Formula pucha tha circular queue jo class m btaya tha unhone
97. What is binary tree
98. tree vs graph
99. implement tree
100. binary heap?
101. aur yaad nhi aa rha..
102. Graph representation-which one will u prefer when
103. Time comp. and space complexity
104. Graph Representation
105. Ek Graph bnao aur usko Adjacency Matrix se represent kro,
106. What is stack memory and what happened after it got deleted
107. What is hashing
108. Aur bhi kuch tha, yaad nhi
109. AVL tree complexity
110. Tree traversing
111. Graph application
112. Implementation of tree
113. Bubble sort, insertion sort, selection sort worst and best time complexity
114. Prims algo
115. Tree traversal in detail
116. Diff graph vs tree
117. B+ tree kya hota hai
118. Avl tree advantage
119. Krunker's algorithm?
120. What is a graph and traverse it ?
121. How to insert a node in the middle of a circular link list ?
122. Conditions of overflow in queue?
123. What is Stack
124. Avl tree
125. Dfs and bfs
126. Tower of hanoi
127. ADT
128. All AVL Rotation
129. How we represent Graph
130. Graph applications
131. .Linear data structure and non linear data structure with its example
2.prims algorithm 3.what is data structure..application of data
 structure 5.Difference between bfs and dfs 6.Quick sort worst
and best time complexity..
132. Draw B+ tree
133. Its applications
134. Diff bw B tree and B+ tree
135. B+ tree me fill kaise karoge
136. Bubble sort complexity in all 3 cases
137. Is merge sort a stable sort
138. Can time complexity be calculated using recursion
139. Graph def
140. Bfs vs DFS
141. How to implement bfs and dfs
142. Completed graph
143. Suppose you are given an undirected graph from A to B in how many way
can you reach that
144. Merge sort complexity and derive it on notebook
145. Hanoi tower
146. Graph traversal
147. Dfs ka example leke kro notebook me
148. Quick sort complexity
149. And Djikstra algo
150. Most ques are from tree and simple uses of graph speak just what you

🙂
know I explained a question using word 'completed graph' he asked me it's
def thank God I had known it
151. Are wo bas tumhara level dekh rahe the kitna tumhe aata hai if you can
answer 5 out of 10 correctly and at least 3 you may say half incorrect or co
relate it and you same face to face that you don't know other 2 then he would
still get good impression
152. He asked me for tree and graph but for sort kuch nahi bataya except time
complex and just said about that I know time complex
153. Derive worst case time complexity of quick sort
154. Prove that a complete graph has n*(n-1)/2 edges
155. What is Kruskal's algorithm
156. What is level in a graph
157. What is ADT
158. What is indegree
159. What is a degree
160. Memory stack?
161. Kruskal's algo
162. Biconnected graph?
163. What is Topological Sorting
164. Heavily connected graph?
165. Weakly connected graph?
166. Advantages of AVL tree
 167. Selection, insertion and bubble all case complexities
168. What is a loop
169. What is an undirected acyclic graph?
170. Priority queue application
171. Preprocessor directives
172. Tower of Hanoi
173. How to insert a node in last of circular linked list
174. Minimum spanning tree,
175. Djikstra (pata nahi kya h) algorithm,
176. Linked list or array for stack implementation,
177. Queue overflow condition,
178. level of graph kya hota hai

CSE C LAB

1. Code likho fir finding max. Data in linked having 3 groups

2. Code for finding factorial using ternary operator

3. Use bubble sorting recursively (code likho)

4. Stable sort with example

5. Tournament tree with example...

1.Overflow condition of queue

2.DFS kis data struc se implement hoga

3.why avl tree introduced

Ek code likhwaya

Pehle pooche dfs aur bfs kaun se ds mein use karte hai phir question change kar
diye aur keh rahe ki ham to pooche the ki dfs aur bfs kaun se ds se implement karte
hai

Phir ek merese complete tree ke baare mein poocha

1.Make a tree and do Preorder Traversal

2.MergeSort Recursively Time Complexity calculate

3.BFS m konsa DS use hota h aur karke dikhao

4.Tournament Tree
5.Kruskal's Algorithm

Find the complexity of merge sort using recursion

How many nodes will be there in a tree of height h

How many steps are there in tower of Hanoi

how to to find the maximum element in a linked list without using conditional operator

bfs and dfs me konsa ds use hota hai

B b++ tree

Adjacent matrix in graph

Order pre ,in,post traversal all in tree

Insert node after node 😀

Bst ka preorder traversal

Reversing linked list

Dfs bfs ki time complexity adjacency list se

Aur implementation of stack using linked list and using array dono m difference

Stack ka peek function

Implementation of stack using linked list ?

How to do it ?

Explain it to him ?

Or write the code and show ?

Dono m difference pucha tha

Something like ki array and linked list k case m top peek krne pr dono cases m kya
diff hoga to vahi dynamic memory allocation nd all bta k aa gyi m to

Bst ka preorder traversal

Reversing linked list

Dfs bfs ki time complexity adjacency list se

Find the complexity of merge sort using recursion

How many nodes will be there in a tree of height h

How many steps are there in tower of Hanoi

1.Make a tree and do Preorder Traversal

2.MergeSort Recursively Time Complexity calculate

3.BFS m konsa DS use hota h aur kark dikhao

4.Tournament Tree

5.Kruskal's Algorithm

Ek code likhwaya

Pehle pooche dfs aur bfs kaun se ds mein use karte hai phir question change kar
diye aur keh rahe ki ham to pooche the ki dfs aur bfs kaun se ds se implement karte
hai

Phir ek merese complete tree ke baare mein poocha

1.Overflow condition of queue

2.DFS kis data struc se implement hoga

3.why avl tree introduced

1. Code likho fir finding max. Data in linked having 3 groups

2. Code for finding factorial using ternary operator

3. Use bubble sorting recursively (code likho)

4. Stable sort with example

5. Tournament tree with example…

Pad liye ab so jao…..

CSE A THEORY

#Implementation of array by two stack

#Non comparable sorting type

#Graph data structure

#Complexity in making of graphs...

Min comp in kruskal. How to achieve..

Name some linear n non linear ds....

Bucket sort. When to use...

Which sorting better ur unpopular opinion..

Each que asked to almost all

#Aur bhi the kuchh ki time complexity of graph

#Implementation bye matrix

#Implementing 2 stacks in a array efficient one... And some sucked up ques

#What sorts are used for non comparison - Radix sort and bucket sort and their
Time complexities

Kruskal complexity and what it is

Spanning tree

#Prims algorithm

Spanning tree

Binary tree def

No. Of spanning tree in graph

#Krushkal algorithm

Time complexity of krushkal algorithm

Non comparison sorting algorithm with time complexity

How to delete from linked list

Implement queue using linked list

Nhi aata ho to keh dena nhi aata..kahi se dekh ke mat padhna..unko pata chal ja rha
hai..

#Graph padh lena guys

Khal udher ke puch rahi graph ki

#Complete binary tree

#Fir linear sorting algos

#Merese pucha n stacks using array

#Fir unke application tak baat aa gyi thi

#Bucket and radix hoti h ... Best case mai bhi i guess

#how to represent graph

is every strictly binary tree are complete binary tree

advantages of circularly linked list

priority queue and their advantages

#how graph can be implemented ? priority queues ? quick sort algorithm ?

# is strictly binary Whattree

#applications of priority queue

#Application of queue

#Radix sort

Bucket sort

#Linear time searching algorithm

#Application of stacks

#What is heap data structure

#What is creating graph complexity for adjacency list and matrix.

How is it O(V+E) for list

What is algo for single source shortest path

Can we use djikstra for negative value

#How do we implement heap

#If we have to insert new element in a heap what's the process

#Heaps are used in which data structure

#Can we do radix sort on alphabets

#What is the criteria for using bucket sort

#Complete binary tree

#Radix sort

#Complexity

#Can insertion in heap be contant time

[3/1, 14:45] Abhinav Goel: Implementation of array by two stack

[3/1, 14:45] Abhinav Goel: Non comparable sorting type

[3/1, 14:45] Abhinav Goel: Aur bhi the kuchh ki time complexity of graph

[3/1, 14:45] Abhinav Goel: Graph data structure

[3/1, 14:45] Abhinav Goel: Implementation bye matrix

[3/1, 14:45] Abhinav Goel: Graph by adjacency matrix hoga

[3/1, 14:45] Abhinav Goel: What sorts are used for non comparison - Radix sort and
bucket sort and their Time complexities

Kruskal complexity and what it is

Spanning tree
[3/1, 14:45] Abhinav Goel: Priority queue ig

[3/1, 14:45] Abhinav Goel: Complexity in making of graphs...

Min comp in kruskal. How to achieve..

Name some linear n non linear ds....

Bucket sort. When to use...

Which sorting better ur unpopular opinion..

Each que asked to almost all

[3/1, 14:45] Abhinav Goel: Krushkal algorithm

Time complexity of krushkal algorithm

Non comparison sorting algorithm with time complexity

How to delete from linked list

Implement queue using linked list

Nhi aata ho to keh dena nhi aata..kahi se dekh ke mat padhna..unko pata chal ja rha
hai..

[3/1, 14:45] Abhinav Goel: Spanning tree

[3/1, 14:45] Abhinav Goel: Prims algorithm

Spanning tree

Binary tree def

No. Of spanning tree in graph

[3/1, 14:45] Abhinav Goel: Complete binary tree

[3/1, 14:45] Abhinav Goel: Merese pucha n stacks using array

[3/1, 14:45] Abhinav Goel: Graph padh lena guys

Khal udher ke puch rahi graph ki

[3/1, 14:45] Abhinav Goel: Bucket and radix hoti h ... Best case mai bhi i guess

[3/1, 14:45] Abhinav Goel: how to represent graph

is every strictly binary tree are complete binary tree

advantages of circularly linked list

priority queue and their advantages

[3/1, 14:45] Abhinav Goel: Fir linear sorting algos

[3/1, 14:45] Abhinav Goel: how graph can be implemented ? priority queues ? quick
sort algorithm ?

[3/1, 14:45] Abhinav Goel: Radix sort

Bucket sort

[3/1, 14:45] Abhinav Goel: applications of priority queue

[3/1, 14:45] Abhinav Goel: Linear time searching algorithm

[3/1, 14:45] Abhinav Goel: What is strictly binary tree

[3/1, 14:45] Abhinav Goel: Application of stacks

[3/1, 14:45] Abhinav Goel: Application of queue

[3/1, 14:45] Abhinav Goel: Strictly binary and full binary tree same hote hai na?

[3/1, 14:45] Abhinav Goel: Nahi same nhi hote strictly binary tree me all levels full
hona zaruri nhi... Full binary tree is a strictly binary tree in which all levels are
completely full

[3/1, 14:45] Abhinav Goel: If we have to insert new element in a heap what's the
process

[3/1, 14:45] Abhinav Goel: What is heap data structure

[3/1, 14:45] Abhinav Goel: How do we implement heap

[3/1, 14:45] Abhinav Goel: What is creating graph complexity for adjacency list and
matrix.

How is it O(V+E) for list

What is algo for single source shortest path

Can we use djikstra for negative value

[3/1, 14:45] Abhinav Goel: What is the criteria for using bucket sort

[3/1, 14:45] Abhinav Goel: Radix sort

[3/1, 14:45] Abhinav Goel: Heaps are used in which data structure

[3/1, 14:45] Abhinav Goel: Can we do radix sort on alphabets

[3/1, 14:45] Abhinav Goel: Complete binary tree

[3/1, 14:45] Abhinav Goel: Can insertion in heap be contant time

DS THEORY CSE C2

#Use of stack n heap in computer's memory

#Eg of multitasking in computer

#Abstract data type

#Abstract data type

Difference between multitasking and multiprogramming

Example of multitasking

What is thread and uses in computer

Abstract data type

Number of edges in graph

Bakki rapid fire tha yaad nhi🌝

#Time complexities sort krne ko boli thi pehle to...

Aur phir vo time complexities m hi jyada hi deep m jane lgi 🙉🙉🤧

Aur phir linked using stack ka implementation

#Linked using stack ya stack using linked?

#linked using stack ya stack using linked

#Stack using linked list tha 🤧

#Bst

Forest

Big O defn

Quick sort pura

#quick sort se poocha ...

#ur types of adt .

#queue adt

#What is adt ? 🥲
#An abstract data type is a set of operations. ADTs are mathematical abstractions;
now here in

an ADT’s definition is there any mention of how the set of operations is implemented.

Objects such as lists, sets and graphs, along with their operations can be viewed as
abstract

data types.

#Priority queue difference from normal queue

Deletion in bst , one child case explain

Time complexity of insertion in priority queue implemented using heap

Best and worst case

#How de insert element in heap

Insert at beginning of circular linked list

Stack using linked list

Heap sort
#Dilishitea algorithm

What are assymptotic notations explain

Kushkal algorithn explain

Queue using linked list explain

#And their corresponding time complexities

#Linear time algos

B vs B+ tree

Asymptotic notation

Counting sort

Bucket sort tc

Queue by linked list

Asymptotic notation

Shell sort

What representation of graph do we use when graph is sparse

And why..

Insertion in BT Deletion..in all cases..and their procedure...

Heap sort me deletion ..and their procedure..