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);
}

}

Define a relation?

947

---

What are basic algorithms?

905

---

Can we insert null in hashset?

1077

---

What are the different types of collections?

978

---

Which data structure is applied when dealing with a recursive function?

1040

---

List the types of tree.

905

---

What is hashing with example?

933

---

Can you override methods of arraylist?

994

---

Mention the data structures which are used in graph implementation.

883

---

Can hashset contain duplicates?

976

---

Explain binary tree traversals?

931

---

Is binary tree a bst?

914

---

What is peek in stack?

942

---

Define separate chaining?

963

---

Define quadratic probing?

1033

---