Grokking Oracle Coding Interview
Vote

0% completed

​
Hidden Document
Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content

.....

.....

.....

Like the course? Get enrolled and start learning!
Ali Simsek

Ali Simsek

· 2 years ago

for the input [1,2,3,4,5,6,7] expected output should be [1,3,7] as it's given in the example but when run the test cases, expected output seems that [1,3,5] which is wrong.

Show 1 reply
V

vipulmeh23

· 2 years ago

After the for loop iterates through the length of the level, just add the node that you get after popleft. Extra logic, does not make much sense.

from collections import deque

#class TreeNode:
#  def __init__(self, val):
#    self.val = val
#    self.left, self.right = None, None

class Solution:
  def traverse(self, root):
    result = [] # List[int]
    if root is None:
      return result

    # TODO: Write your code here
    q = deque()
    q.append(root)
    while q:
      level_size = len(q)
      for _ in range(level_size):
        node = q.popleft()
        
        if node.left:
          q.append(node.left)
        if node.right:
          q.append(node.right)
        
      result.append(node.val)

    return result

Reading Progress

0%