Answer Posted / chinnadurai.s
A tree with at most two children for each node.
or
A binary tree either
* is empty (no nodes), or
* has a root node, a left binary tree, and a right
binary tree.
| Is This Answer Correct ? | 5 Yes | 0 No |
Post New Answer View All Answers
write a code for Implementation of stack and queues.
Write a Program for Linked list manipulation.
Run time memory allocation is known as in data structure?
Why do we need linked lists?
What is bubble sort and selection sort?
How do you find the space complexity of a bubble sort?
List out the basic operations that can be performed on a stack?
What are the different types of collections?
Differentiate between collection and collections.
What is the difference between 1d and 2d array?
Can hashmap have duplicate keys?
How do you find the complexity of a bubble sort?
What are the types of bulleted list?
Find duplicates in infinite range. Which data structure to be used to give efficient solution?
What do you mean by sorting data?
