Interested to Buy Any Domain ? << Click Here >> for more details...
Answer Posted / chandra
the tree has at least two child is called a binary tree
.
| Is This Answer Correct ? | 0 Yes | 9 No |
Post New Answer View All Answers
Please Help Members By Posting Answers For Below Questions
Where is binary tree used?
Is radix sort faster than quicksort?
Can we search the data in a linked list?
What do you mean by data and data structure?
What are different techniques for making hash function? Explain with example.
Can a stack be described as a pointer? Explain.
Why sorting algorithms are important?
How do you initialize an arraylist?
Can a binary tree be empty?
Define leaves?
Which is faster arraylist or hashmap?
Can we change the size of an array at run time?
What is hashing technique?
What are the complexity of binary search?
What is the best time complexity of bubble sort?
