You want to insert a new item in a binary search tree. How would you do it?

0 Answers  

---

Are linked lists considered linear or non-linear data structure?

0 Answers  

---

1) Program A and B are analyzed and found to have worst- case running times no greater than 150nlog2n and n2 respectively.Answer the folloWing questions if possible.. i) which program has the better guarantee on the running time,for larger values of n(n>10000) ? ii) which program has the better guarantee on the running time,for small values of n(n<100) ? iii) which program will run faster on average for n =1000 2) wRite a program to compute the number of collisions required in a long random sequence of insertions using linear probing ,quadratic probing and double hashing 3) what is the optimal way to compute A1 A2 A3 A4 A5 A6 where the dimensions of the matrices are A1:10*20 A2 : 20 * 1 A3 : 1 * 40 A4 : 40*5 A5 : 5 * 30 A6 : 30 X 15

5 Answers   KPIT,

---

What is a binary search tree? Explain with example?

0 Answers  

---

In which data structure, elements can be added or removed at either end, but not in the middle?

42 Answers   Infosys, NIC, TTA, Wipro,

---

What is data structure definition?

0 Answers  

---

Explain what is binary search?

0 Answers  

---

What does args stand for?

0 Answers  

---

Define a right-skewed binary tree?

0 Answers  

---

create an singly linked lists and reverse the lists by interchanging the links and not the data?

13 Answers   Microsoft, TCS,

---

What do you mean by structure property in a heap?

0 Answers  

---

What are the disadvantages of sequential storage?

0 Answers  

---