Interested to Buy Any Domain ? << Click Here >> for more details...
Answer Posted / kushal bagaria
Binary tree is a tree which has maximum no. of childrens
either 0 or 1 or 2. i.e., there is at the most 2 branches in
every node.
| Is This Answer Correct ? | 20 Yes | 2 No |
Post New Answer View All Answers
What do you mean by open addressing?
What is the top of a stack?
What is return map?
“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?
Differentiate bfs and dfs?
Do you know how to find if linked list has loop?
What are the basic operations of stack?
What are the Differences between map and hashmap?
Why heap sort is not used?
When ArrayIndexOutOfBoundsException occurs?
What is difference between while and do while?
How is heap sort implemented?
Is treeset sorted?
Does treeset remove duplicates?
How many types of priority queue are there?
