Answer Posted / siya
a binary tree is a tree,whose root has degree 2 and other
nodes has degree 2or 3.
| Is This Answer Correct ? | 1 Yes | 3 No |
Post New Answer View All Answers
Why sorting algorithms are important?
Explain the common uses of tree database.
why boundary tag representation is used?
What is difference between concurrenthashmap and hashtable?
Draw a binary Tree for the expression : A * B - (C + D) * (P / Q)
How does shell sort work?
Differentiate null and void?
Mention the advantages of representing stacks using linked lists than arrays?
What is the space complexity of bubble sort?
What does the term sorting refer to?
Is linked list faster than array?
What are the properties of an algorithm?
Can map contain duplicate keys?
Explain stacks and queues in detail.
How do you separate zeros from non-zeros in an array?
