Answer Posted / e.e.n.bashy

c with no cursor but c++ have cursor

What is object and example?

1178

---

What is new keyword in oops?

1045

---

What is the difference between static polymorphism and dynamic polymorphism?

1090

---

what type of question are asked in thoughtworks pair programming round ?

2217

---

What is encapsulation selenium?

1010

---

Who invented oop?

1133

---

Can enum be null?

1020

---

Give two or more real cenario of virtual function and vertual object

2329

---

What are the 4 main oop principles?

1225

---

What are oops functions?

1020

---

What is static in oop?

1081

---

officer say me - i am offered to a smoking , then what can you say

2102

---

State what is encapsulation and friend function?

1266

---

#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.

3761

---

Can bst contain duplicates?

1193

---