Interested to Buy Any Domain ? << Click Here >> for more details...
Answer Posted / deepak pareek
ROOT NODE IS THE MEJOR PART OF TREE..
IT IS ALSO CALLED PARENT NODE.
IT HAS FURTHER TWO NODE'S..
1: LEFT NODE
2: RIGHT NODE
THESE NODE IS CALLED AS CHILD NODE.
| Is This Answer Correct ? | 24 Yes | 8 No |
Post New Answer View All Answers
What is a comparator function?
What data structure does a binary tree degenerate?
Is unordered_map a hash table?
What do you mean by heap order property?
Is hashset a collection?
What is the difference between arraylist and linkedlist?
What is m way tree in data structure?
How can you represent a linked list node?
What is the time complexity of selection sort?
Why you need a data structure?
Can you tell me the differences between Array and ArrayList?
Explain the difference between hashset and hashmap?
Is hashmap sorted?
What method removes the value from the top of a stack?
List the applications of stacks?
