Interested to Buy Any Domain ? << Click Here >> for more details...
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
Explain binary search tree?
Why is treeset sorted?
What does list clear do?
What are different types of linked lists?
Evaluate the following prefix expression " ++ 26 + - 1324" (Similar types can be asked)
What is pivot in quicksort?
Describe the degree term in a tree.
Does concat mutate array?
What is rule regarding overriding equals and hascode method?
What sorting algorithm should be used for sorting strings?
What do you mean by articulation point?
Which collection class is thread safe?
Is duplicate allowed in hashmap?
Which sorting algorithm is best for small data?
What is data type with example?
