Tip 1 : Practise questions
Tip 2 : Join online programs for coding
Tip 3 : Do atleast 2 projects
Tip 1: No false information
Tip 2: At least 2 projects






The merging process must start from the root nodes of both trees.
‘ROOT1’ = [1, 2, -1, -1, 3, -1, -1] ‘ROOT2’ = [3, -1, -1].
The final tree would look like : [3, 2, -1, -1, 3, -1, -1], and the output will be printed in a pre-order way: 4 2 3.




Detech loop in a linked list

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is the best case time complexity of Bubble Sort?