Answer Posted / n.k
Binary tree is a tree which has at most two sub node namely
left sub tree and right sub tree or may be null
| Is This Answer Correct ? | 3 Yes | 1 No |
Post New Answer View All Answers
Please Help Members By Posting Answers For Below Questions
Why hashmap is faster than hashset?
Why sorting algorithms are important?
What is the height of binary tree?
Why is it called bubble sort?
How do you replace an element in an arraylist?
Is bucket sort a comparison sort?
Can hashmap have same key?
Define a binary search tree?
What is time complexity of binary search?
Differentiate between arraylist and linkedlist.
Define linked lists?
What do you mean by 2-3 tree?
Write an algorithm that counts number of nodes in the circular linked list
What is an algorithm in coding?
What is time complexity of arrays sort?
