Project Engineer

Linear equation related question, Reasoning AND OR question.

Asked about projects. I was doing projects related to sorting so 
1. Gave me one array example on the pare and asked to find no of swap and comparisons using my solution.
2. Asked about Object Oriented question like inheritance at easy level.
3. Asked little about Tree data structure, normal question like traversal etc.

You have been given a Binary Tree of 'n' nodes, where the nodes have integer values. Your task is to return the In-Order traversal of the given binary tree.

For example :

For the given binary tree:

The Inorder traversal will be [5, 3, 2, 1, 7, 4, 6].

Bubble Sort is one of the sorting algorithms that works by repeatedly swapping the adjacent elements of the array if they are not in sorted order.

You are given an unsorted array consisting of N non-negative integers. Your task is to sort the array in non-decreasing order using the Bubble Sort algorithm.

For Example:

Bubble Sort implementation for the given array:  {6,2,8,4,10} is shown below :-