What are the parts of root node?
Answers were Sorted based on User's Feedback
Answer / wizard
A root node contains data part and has link part. i.e links
to its child. if it is binary tree it has two links i.e left
child and right child
| Is This Answer Correct ? | 36 Yes | 6 No |
Answer / 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 |
Answer / 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 |
Answer / bipin from utkal university mc
root node is a special node which has no parent node.It
contains one or more field for storing children address
and also contains a data field for storing key value
| Is This Answer Correct ? | 6 Yes | 0 No |
Answer / kannan
A root node has no child node
If it contain chid the address part of the node contains
NULL value
| Is This Answer Correct ? | 2 Yes | 12 No |
Explain binary representation?
What is array simple?
What is heap and its types?
How do you access the values within an array?
Define non-terminal nodes in a tree?
What is a comparator function?
Which collection class is thread safe?
How do you declare A pointer to array of three chars
what is a balanced tree.
How arraylist increase its size?
How do I start preparing for placement?
Run time memory allocation is known as in data structure?