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
Is hashmap sorted?
Which is faster list or set?
What are doubly linked lists?
What is precision in data structures?
What are the advantage of collection classes over arrays?
By Which algorithm, the 8 queens problem is solved?
What is data type in data structure?
Define a path in a tree?
Which is better hashmap or treemap?
Why insertion is faster in linked list?
Name the areas in which you can apply data structures extensively?
Define hash table?
What is the Role of push() and pop() method?
Define in brief an array.
Which is better merge sort or quick sort?
