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
Explain what are the major data structures used in the network data model?
What is heap tree in data structure?
Define linear probing?
Is array static or dynamic?
How many sorting are there in data structure?
Explain the term base case?
What are stacks? Give some of its applications.
Explain the uses of b+ tree.
What do you mean by 2-3 tree?
What is a hashers run?
What is the difference between a push and a pop?
What is dynamic array how is it created?
Do you know how to find if linked list has loop?
What are types of Collision Resolution Techniques and the methods used in each of the types?
What are linked list?