Answer Posted / shital

typedef struct NODE
{
int data;
struct NODE *left,*right;
}node;

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

}

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

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

}

What is array and structure?

1038

---

Explain the principle of quicksort. What is its complexity?

1105

---

Is it possible to store null key and null values in a hashmap?

899

---

What is a singletonlist?

941

---

What is a priority queue?

1023

---

Explain what are the methods available in storing sequential files ?

993

---

Explain about the different lists available in the collection?

922

---

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

972

---

What are the types of collection?

932

---

Which is better bubble sort or selection sort?

888

---

What type of variable is age?

925

---

What is data structure and its operations?

895

---

Explain the implementation of an AVL tree and Binary tree.

1005

---

What does quick sort do?

936

---

Is radix sort stable?

962

---