Answer Posted / meenakshi
Root node basically have 2 parts i.e LEFT SUBTREE and RIGHT
SUBTREE. These subtrees have further divisions and having
many no. of children.
| Is This Answer Correct ? | 8 Yes | 1 No |
Post New Answer View All Answers
Why sorting is done?
What is a priority queue?
Why are b trees used?
What does args stand for?
Is hashset thread safe?
Write code for reversing a linked list.
Give a real time example of stack
What is the structure of an array?
What is red black tree in data structure?
What is link list in data structure?
Why sorting is used?
Briefly explain recursive algorithm?
List all data structures you would use for a memory management module.
How will you free the memory that is allocated at run time?
What are the main differences between the linked list and linear array?