Answer Posted / ajay
A binary tree is a data structure in which the nodes
contains at most two links(i.e.,left child and/or right
child)
| Is This Answer Correct ? | 18 Yes | 1 No |
Post New Answer View All Answers
Is it possible to increase size of array?
Define threaded binary tree. Explain its common uses
How to get the index of an array element?
Explain recursive function & what is the data structures used to perform recursion?
What is the Difference between treemap and hashmap?
What does arraylist remove do?
Which language is best for data structures and algorithms?
List the basic operations carried out in a linked list?
What is comparable interface?
What is the structure of an array?
What can be stored in an arraylist?
Does hashset maintain order?
What are the applications of b-tree?
What happens if we put a key object in a hashmap which exists?
What is push and pop in stack?