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

}

Is arraylist a class?

982

---

What are the major data structures used in the network data model?

1061

---

Write an algorithm to show various operations on ordered list and arrays

928

---

Which interface treemap implements?

974

---

Is hashset a collection?

922

---

Explain the Stack

971

---

Which data structures are used in bfs and dfs algorithm?

1040

---

What is difference between hashmap and arraylist?

967

---

What is the capacity of arraylist?

938

---

Can we add or delete an element after assigning an array?

1051

---

What are the average and worst time complexity in a sorted binary tree is

967

---

Differentiate between hashmap and treemap.

971

---

How is heap sort implemented?

831

---

Differentiate null and void?

868

---

What is data structure explain in detail?

901

---