Answer Posted / nashiinformaticssolutions
An extension of the linked list structure, a binary tree contains no more than two children per node.
There are always two nodes in a binary tree: a left node and a right node.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
Which sorting technique is best in worst case?
What is unbounded queue?
Describe stack operation.
What are different techniques for making hash function?
What is range search?
What actions are performed when a function is called?
Which sorting algorithm is best for small data?
What is sorting explain?
What is sort order?
Differentiate bfs and dfs?
How many types of data structures are there?
What are data and data types?
Can hashset contain null?
How do you check if a stack is empty or not?
What is the idea behind splaying?