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
Give the example of validating the parenthesis of expression using stack.
What does each entry in the link list called?
How can we delete the first node from the singly linked list?
What is difference between list and set?
What is the use of threaded binary tree?
What is data structure? Explain.
Is heap sort adaptive?
What is homogeneous array?
Which is faster quick sort or merge sort?
What is the advantage of the heap over a stack?
What is dangling pointer and how to avoid it?
What is doubly linked list in data structure?
Tell me how to find middle element of linked list in one pass?
What is time complexity of binary search?
Why is an array homogeneous?