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
Why is hashset used?
How do stacks work?
What is complexity of quicksort?
Can we insert null in list?
Is array faster than arraylist?
Is binary tree balanced?
How to show internal storage representation of data structure in RDBM?
Write a program to reverse a link list.
Does array sort mutate?
Is list a data type?
What are the major data structures used in the network data model?
Why is quicksort unstable?
What is a subtree?
Can we give size to arraylist?
What is merge sort in daa?