Answer / swetcha

Binary tree is a tree with at most two children for each
node.Also known as dyadic tree.
most formal defination is that
A binary tree either

.is empty (no nodes), or
.has a root node, a left binary tree, and a right binary
tree
These r the various types where we use the actual binary
tree
complete binary tree, full binary tree, binary search tree,
binary heap, balanced binary tree, threaded tree, Fibonacci
tree, extended binary tree

what is difference between kpo and it industry? that is in terms of work, package etc

0 Answers  

---

What is the difference between in-proc and out-of-proc?

2 Answers   Oracle,

---

whats the Need for Concurrency control

1 Answers  

---

Write a program to find duplicate number from array in minimum time complexity.

0 Answers   Genpact,

---

Write a program to read and print a text file on screen

1 Answers   Peerless,

---

DIFFERENCE BETWEEN BINDING LANG AND BIND DIR WHEN USING IN SERVICE PGM

0 Answers   CTS,

---

Define Form modules, Class modules and Standard modules

0 Answers   Global Hunt,

---

we can use parameters in cl and rpg pgms...etc.in particular i think when we use data area or datastructure or data queue .i think this means which one====in my question...parameters cannot be passed in which one????hope understand my qstn???

0 Answers   CTS,

---

What are data structures?

1 Answers  

---

what is difference between object oriented programming structure and object oriented programming system?

0 Answers  

---

what is throws keyword

1 Answers   IBM,

---

Expand the following a) ISDN b) CASE c) CSMA/CD d) OOPS e) MIMD

4 Answers   CTS,

---