Question

i need some hot questions based on programming using linkedlist and trees.(atleast 5)

Answer 1

hey...

What type of memory allocation is referred for Linked lists?

Describe what is Node in link list? And name the types of Linked Lists?

Mention what is traversal in linked lists?

Mention what is Singly Linked list?

Mention what is Linked lists

. Consider an implementation of unsorted singly linked list. Suppose it has its representation with a head pointer only.
Given the representation, which of the following operation can be implemented in O(1) time?
i) Insertion at the front of the linked list
ii) Insertion at the end of the linked list
iii) Deletion of the front node of the linked list
iv) Deletion of the last node of the linked list
a) I and II
b) I and III
c) I, II and III
d) I, II and IV

. What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list?
a) O(1)
b) O(n)
c) θ(n)
d) θ(1)

Answer 2

Explanation:

Durva plz rok ja brainly mat leave kar....plz sorry sorry