wanghsinche / essay Goto Github PK

def dfs(root):
  res = []
  if not root:
      return res
  if isSatisfied(root):
      res.append(root.val)
  for ele in root.children:
      left = dfs(ele)
      for i in left:
          res.append(i)
  return res

def bfs(root):
  res = []
  q = [root]
  while len(q) > 0:
    layer = q
    q = []
    for ele in layer:
         if not ele:
            continue
         if isStatified(ele):
            res.append(ele.val)
         for i in ele.children:
            q.append(i)
   return res

def bst(array):
    if len(array) <= 1:
      return isStatified(array)
    left, right = sperate(array)
    if isIn(left):
      return bst(left)
    return bst(right)