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
What are the 4 types of data?
Differentiate between an array and an arraylist.
What is difference between array and arraylist? When will you use array over arraylist?
What is the default size of an arraylist?
Define in brief an array. What are the types of array operations?
Write a program for reversing the Single Linked List?
how to add an item to the beginning of the list?
Can arraylist have null values?
State the merits of linear representation of binary trees?
How to find if linked list has loop?
Explain stacks and queues in detail.
Why hashmap is faster than hashset?
What is meant by binary tree traversal?
Why is arraylist faster than linkedlist?
What is structured data with example?
