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
Does treeset allow null values?
What is the use of bubble sort?
Is bucket sort stable?
Why does hashset use hashmap?
Is a hashset ordered?
Can hashmap have same key?
What do you mean by tree edge?
What is the time complexity of arraylist and linked list?
What is the best case complexity of bubble sort?
Is it possible to increase size of array?
What is int data type?
What is the difference between data types and data structures?
What is data structure operations?
What does arraylist remove return?
Difference between calloc and malloc in data structures?
