Answer Posted / himani madan
A binary tree is a tree in which each node has either 0 or 2
child nodes.
| Is This Answer Correct ? | 5 Yes | 4 No |
Post New Answer View All Answers
Which sorting algorithms are in place?
Which is faster quick sort or merge sort?
Why do we use hashset?
What do you know about different sorting algorithms?
Tell me can the size of operator be used to tell the size of an array passed to a function?
How do arrays work?
Define non-linear data structures?
How do you find the second largest element in an array of integers?
What is data and its type?
Compare Queue and Topic ?
Why insertion is faster in linked list?
Does treemap allow null key?
Why do we Use a Multidimensional Array?
Why heap sort is not used?
Discuss how to implement queue using stack.
