Answer Posted / narendra sharma

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

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

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

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

What is meant by balanced binary tree?

934

---

What is adt example?

1072

---

Which sorting algorithm is used in collections sort?

872

---

Can you please explain the difference between string and an array?

1216

---

Which is best array or linked list?

958

---

What is stable sorting method?

1071

---

What is the difference between data type and data structure?

918

---

How do you sort large data?

1018

---

What is data structure and its classification?

967

---

Write a code for dynamic allocation of array.

1116

---

List some applications of queue data structure.

979

---

Explain the Array

1057

---

What is a weighted graph?

1079

---

What is minimum depth of binary tree?

1026

---

Tell me what is quick sort?

959

---