Answer Posted / bhargav

In Answer 1 i think there is error in dellast()

void dellast()
{
node *temp,*cur=head;
while(cur->next->next!=NULL) -------> error
{
cur=cur->next;
}
temp=cur->next;
cur->next=NULL;
printf("Deleted item is %d\n",temp->item);
free(temp);
}

List the data structures which are used in hierarchical data model.

932

---

What do you mean by spanning tree?

1080

---

What is the two-dimensional array?

1000

---

Explain the term base case?

898

---

What are three common types of traversals?

983

---

What are different techniques for making hash function? Explain with example.

1024

---

Define non-linear data structures?

1014

---

What is application of data structure?

877

---

Define threaded binary tree. Explain its common uses

855

---

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

914

---

Does array sort mutate?

806

---

Differentiate null and void?

850

---

Which is the slowest sorting algorithm?

927

---

How can we delete any specific node from the linked list?

902

---

Is array part of collection framework?

888

---