Answer Posted / sri
A binary tree is a tree which is either empty or each node
has at-most two children
The root node is the parent of all the nodes
its height is given by log n base 2 where n is the no of
elements
| Is This Answer Correct ? | 3 Yes | 0 No |
Post New Answer View All Answers
Is arraylist heterogeneous?
What thread means?
List the area of applications where stack data structure can be used?
What is the best data structure and algorithm to implement cache?
What is sequential search? What is the average number of comparisons in a sequential search?
What is scalar example?
Name few concurrent collection classes?
Why do we need to use computers to help us sort lists?
Is data structures and algorithms important?
Does the minimal spanning tree of a graph give the shortest distance between any 2 specified nodes?
What are linear and non linear data structures?
Define 2-3-4 tree?
What is data structure and data type?
What are scalar values?
What is return map?