In the given binary tree, using array you can store the node 4 at which location?
1 2 3 - - 4 - - 5
Answer / phool chand
Root LC1 RC1 LC2 RC2 LC3 RC3 LC4 RC4
where LCn means Left Child of node n and RCn means Right Child of node n
| Is This Answer Correct ? | 0 Yes | 0 No |
Define data type and what are the types of data type?
Define internal nodes?
What do you understand by stable sort?
Why is hashmap not thread safe?
Give us a program to reverse a linked list.
Is treemap sorted?
How do I remove a value from a list?
Differentiate between comparable and comparator.
Which is better hashmap or treemap?
What is the difference between static and dynamic data?
Is complete binary tree?
What is the best case time complexity of bubble sort?