Answer Posted / manish kit
A binary tree is a non liniear data structure in which
there must be both child of each node acxept leaf node
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
Can treemap key null?
Which language is best for data structures and algorithms?
Why do we use different types of data structures?
Is hashset thread safe?
What is hash data type?
What is the difference between arraylist and hashmap?
What is ordered map?
Different Types of pattern?
Which is faster array or arraylist?
Which is better merge or quick sort?
What is advantage and disadvantage of linked list?
Why is arraylist faster than linkedlist?
What is the complexity of sorting algorithm?
What is data structure operations?
State the difference between queues and linked lists?
