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
Why it is important to have aligned addresses? What is the exception generated when there is a misaligned address?
What is insertion sort technique?
Are sets sorted?
What do you mean by disjoint set adt?
Write the steps involved in the insertion and deletion of an element in the stack.
What is a matrix? Explain its uses with an example
What is the easiest sorting method to use in data structures?
Can treemap key null?
Write a code for dynamic allocation of array.
Does set allow null values?
How do you do binary search?
What is an object array?
What actions are performed when a function is called?
Does treemap sort on key or value?
What is the advantage of circular linked list?
