Answer Posted / ashutosh
a binary tree is a tree in which each naode have 2 child
except leaf naode.
| Is This Answer Correct ? | 5 Yes | 2 No |
Post New Answer View All Answers
Please Help Members By Posting Answers For Below Questions
Write code for reversing a linked list.
List the applications of queues?
Write the algorithm for converting infix expression to postfix expression?
Who created quicksort?
What is the use of bubble sort?
Describe the level term in a tree.
What is dynamic array in excel?
Define collision in hashing?
What is meant by int?
Explain Stack
What is bitonic search?
If we add enum constants to a sorted collection ( treemap , treeset ), what will be the order in which they will be maintained?
What do you understand by stable sort?
What is a subtree?
What is nsmutablearray?
