Answer Posted / duchinna198227
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 ? | 32 Yes | 3 No |
Post New Answer View All Answers
Why is an array homogeneous?
What data type is array?
What is a stable algorithm?
Describe tree database.
How do you separate zeros from non-zeros in an array?
What's the difference between an array and vector?
Is data structures and algorithms important?
What is the order of selection sort?
How does a treemap work?
What are the difference between a stack and a queue?
How many sorting techniques are there?
What do you know about different sorting algorithms?
Define distributed query and linked server?
Why heap sort is not used?
State the properties of b tree.