Interested to Buy Any Domain ? << Click Here >> for more details...
Answer Posted / veeru
A binary tree is a tree in which the degree of a node
maximum 2 is called a binary tree.
| Is This Answer Correct ? | 7 Yes | 1 No |
Post New Answer View All Answers
Differentiate stack from array?
Define the term “percolate down”?
What is top in stack?
What do you mean by complexity of search algorithm?
What is complete binary tree and almost complete binary tree?
Can arraylist contain null?
What is a simple path?
Mention for which header list, you will found the last node contains the null pointer?
What is the main advantage of a linked list?
How would you swap the Kth node from beginning with Kth node from end in a Linked List.
State the difference between stacks and linked lists?
What is the use of treemap?
Why is reflection slower?
Define balanced trees?
What is the space complexity of quicksort?
