AWS Cloud Support Associate

You are given an arbitrary binary tree, a node of the tree, and an integer 'K'. You need to find all such nodes which have a distance K from the given node and return the list of these nodes.

Distance between two nodes in a binary tree is defined as the number of connections/edges in the path between the two nodes.

Note:

1. A binary tree is a tree in which each node has at most two children. 
2. The given tree will be non-empty.
3. The given tree can have multiple nodes with the same value.
4. If there are no nodes in the tree which are at distance = K from the given node, return an empty list.
5. You can return the list of values of valid nodes in any order. For example if the valid nodes have values 1,2,3, then you can return {1,2,3} or {3,1,2} etc.

Example :

Consider this tree above. The target node is 5 and K = 3. The nodes at distance 1 from node 5 are {2}, nodes at distance 2 from node 5 are {1, 4} and nodes at distance 3 from node 5 are {6, 3}.

Given a binary tree. Find and return the modulus of the difference between the sum of odd level nodes and the sum of even level nodes.

Suppose I have a brand new laptop and I wish to connect it to the internet. What should I do, and what shall happen in background before the laptop is connected to the internet?

What happens in background when I write www.amazon.com on my web browser and hit enter?

What are few methods of HTTP, what is HTTPs, is the port number different for HTTPs, how is SSL related to HTTPs, explain SSL handshake?

What are different types of memory present in a computer?

Explain the concept of virtual memory. If it’s not present in hardware, how does it store data? Explain framing, segmentation and paging.?
Explain the entire boot process of windows. (choice was given between Windows and Linux)