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;

}

Define leaves?

971

---

Is heap sort faster than quicksort?

780

---

Why do we need to use computers to help us sort lists?

874

---

What are the advantages and disadvantages of linked list over array?

972

---

What are linked lists used for?

909

---

Does hashset guarantee order?

870

---

What is stack in data structure with the example?

782

---

What are the basic data structures?

918

---

Write a data structure for a queue.

1168

---

What is unmodifiable list?

891

---

Define circular list?

933

---

How do you do a heap sort?

826

---

What does bubble sort do?

765

---

What member function places a new node at the end of the linked list?

1008

---

What are the pre-requisite for the collection to perform binary search?

851

---