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
How to fill element (initialize at once) in an array?
Is arraylist synchronized?
What are the different types of linked list?
Is array a dynamic data structure?
Is vector synchronized?
Give a basic algorithm for searching a binary search tree?
Can a hashset contain duplicates?
What is time complexity of arrays sort?
Suppose in an integer array, there is 1 to 100 number, out of one is duplicate, how to find?
What is a comparator function?
Which is faster binary or linear search?
How do I use quick sort?
What is the height of a binary tree?
What are the advantages of binary search over linear search?
What is a hashmap in c?
