Answer Posted / aditya

A Linked List is the collection of leniar data elements. In
linked list there will be nodes which has 2 parts. They are
data part and link part. The data part consists of the th
data element and the link part consists of the address of
the next node. In linked list the link part of the last
node will be NULL. The different types of linked list are

1) Linear Linked List
2) Double Linked List
3) Circular Linked List
4) Doule Circular Linked List

How to use CMutex, CSemaphore in VC++ MFC

4786

---

Hi friends I have experience of 6 months in website design and maintanence. Now i am looking for other IT jobs.. to switch platform. please post any interview you know in chennai.

2198

---

Why do we use polymorphism?

1089

---

Which is not an object oriented programming language?

999

---

write knight tour problem which is present in datastructure

2655

---

Where is pseudocode used?

1109

---

write a program using c++ to implement single contiguous memory mangement techniques.display the content of the main memory after yhe allocation of jobs and percentage of the wastage of the main memory

3232

---

What does and I oop mean?

1199

---

What is class encapsulation?

1099

---

What is difference between abstraction and encapsulation?

1084

---

How do you achieve polymorphism?

1082

---

String = "C++ is an object oriented programming language.An imp feature of oops is classes and objects".Write a pgm to count the repeated words from this scenario?

2398

---

What is class and object with example?

1135

---

What is property in oops?

1064

---

#include #include #include #include void insert(struct btreenode **, int); void inorder(struct btreenode *); struct btreenode { struct btreenode *leftchild; struct btreenode *rightchild; int data; }; main() { struct btreenode *bt; bt=(struct btreenode *)NULL; int req,i=1,num; clrscr(); printf("Enter number of nodes"); scanf("%d",&req); while(i<=req) { printf("Enter element"); scanf("%d",&num); insert(&bt,num); i++; } inorder(bt); } void insert(struct btreenode **sr, int num) { if(*sr==NULL) { *sr=(struct btreenode *)malloc (sizeof(struct btreenode)); (*sr)->leftchild=(struct btreenode *)NULL; (*sr)->rightchild=(struct btreenode *)NULL; (*sr)->data=num; return; } else { if(num < (*sr)->data) insert(&(*sr)->leftchild,num); else insert(&(*sr)->rightchild,num); } return; } void inorder(struct btreenode *sr) { if(sr!=(struct btreenode *)NULL) { inorder(sr->leftchild); printf("\n %d",sr->data); inorder(sr->rightchild); } else return; } please Modify the given program and add two methods for post order and pre order traversals.

3767

---