## Amazon Interview Question

Software Engineers**Country:**United States

**Interview Type:**Phone Interview

```
class Node():
def __init__(self, val, left=None, right=None):
self.val = val
self.left = left
self.right = right
root = Node(1)
root.left = Node(2)
root.left.left = Node(4)
root.left.left.left = Node(7)
root.left.left.left.left = Node(9)
root.left.right = Node(5)
root.left.right.left = Node(8)
root.right = Node(3)
root.right.right = Node(6)
def find_left_view(rootNode):
def do_bfs(node):
p = [node]
while p:
q = []
for i, n in enumerate(p):
if i == 0:
print n.val
if n.left:
q.append(n.left)
if n.right:
q.append(n.right)
p = q
do_bfs(rootNode)
find_left_view(root)
```

Visit AONECODE.COM for ONE-ON-ONE private lessons by FB, Google and Uber engineers!

SYSTEM DESIGN Courses (highly recommended for candidates of FB, LinkedIn, Amazon, Google and Uber etc.),

ALGORITHMS (conquer DP, Greedy, Graph, Advanced Algorithms, Clean Coding),

latest interview questions sorted by companies,

mock interviews.

Our students got hired from G, U, FB, Amazon, LinkedIn, MS and other top-tier companies after weeks of training.

Email us aonecoding@gmail.com with any questions. Thanks!

SOLUTION:

BFS approach does it

- aonecoding May 13, 2018