Answer Posted / r. khan
A tree with root[T]has the following properties
if roo[T] is NULL, then there is no node,
otherwise,every node in the tree has at most two child
nodes.
| Is This Answer Correct ? | 9 Yes | 7 No |
Post New Answer View All Answers
Differentiate between singly and doubly linked lists?
How do you make a bubble chart with 3 variables?
Give one example of right rotation.
Does linked list allow duplicates?
What is the space complexity of quicksort?
What do you mean by back edge?
What type of algorithm is binary search?
State the demerit of linear representation of binary trees?
Define hash table?
What is the best case for bubble sort?
Does hashset maintain order?
How efficient is binary search?
Are collections thread safe?
Define non-terminal nodes in a tree?
What is difference between list and array?