Answer Posted / tadveer verma
a tree which has atmost two child is called a binary tree.
| Is This Answer Correct ? | 2 Yes | 3 No |
Post New Answer View All Answers
What is significance of ” * ” ?
What are the categories of avl rotations?
What is the need for path compression?
What are the disadvantages of linear list?
Write a program for reversing the Single Linked List?
Write the recursive c function to count the number of nodes present in a binary tree.
What is sorted map?
What is the space complexity of bubble sort?
When is a binary search algorithm best applied?
What is dangling pointer and how to avoid it?
Which is faster hashmap or treemap?
What is two-dimensional array?
Which is the slowest sorting algorithm?
Which is the parent class of hashmap class?
What are the differences between b tree and b+ tree?