Answer Posted / 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 |
Post New Answer View All Answers
What are the issues that hamper the efficiency in sorting a file?
Given an array of integers, devise a program to replace every element with the next greatest element on the right side in the array. Also, replace the last element with 5 as there no element on the right side of it.
How do you declare An array of three char pointers
How do you represent a linked list?
Why set will not allow duplicates?
Write a Program for Linked list manipulation.
What are different methods of collision resolution in hashing.
Is hashtable better than dictionary?
Define a set?
What is heap tree explain with example?
What is an externalizable interface?
What do you mean by structure property in a heap?
Which list does not allow duplicates?
Which is faster array or list?
Explain the Stack