Answer Posted / meganathan

void inorder(node * tree)
{
if(tree != NULL)
{
inorder(tree->leftchild);
printf("%d ",tree->data);
inorder(tree->rightchild);
}
else
return;

}

void postorder(node * tree)
{
if(tree != NULL)
{
postorder(tree->leftchild);
postorder(tree->rightchild);
printf("%d ",tree->data);
}
else
return;
}

void preorder(node * tree)
{
if(tree != NULL)
{
printf("%d ",tree->data);
preorder(tree->leftchild);
preorder(tree->rightchild);
}
else
return;

}

Difference between arrays and linked list?

995

---

Which sorting is used in collections sort?

922

---

Why is arraylist used?

1017

---

What are the main differences between the linked list and linear array?

1028

---

Can you sort a hashmap?

906

---

What is difference between array and arraylist? When will you use array over arraylist?

1047

---

What is two-dimensional array?

1014

---

What are the applications of priority queues?

1089

---

List the limitations of linear probing?

972

---

What do you mean by 2-3 tree?

986

---

What are the different types of sorting in data structure?

1073

---

Is hashtable better than dictionary?

1005

---

Do sets allow duplicates?

1033

---

What is the capacity of arraylist?

995

---

Explain what is B-tree?

1103

---