Answer Posted / ashutosh
a binary tree is a tree in which each naode have 2 child
except leaf naode.
| Is This Answer Correct ? | 5 Yes | 2 No |
Post New Answer View All Answers
in tree construction which is the suitable efficient data structure? (Array, linked list, stack, queue)
Is linked list faster than array?
What is the difference between data type and data structure?
What are the parts of a linked list?
Why is hashset not ordered?
Explain what is linear search?
Which sorting is used in collections sort?
Can we add duplicate keys in a hashmap?
What is a string or array type?
Explain binary tree traversals?
Differentiate between iterable and iterator.
How do you sort large data?
Define balance factor of a node in avl tree?
What is circular queue example?
What is collection process?
