nodes: 0, module; 1, function_definition; 2, function_name:insort_no_dup; 3, parameters; 4, block; 5, identifier:lst; 6, identifier:item; 7, expression_statement; 8, import_statement; 9, expression_statement; 10, if_statement; 11, comment:"""
      If item is not in lst, add item to list at its sorted position
      """; 12, dotted_name; 13, assignment; 14, comparison_operator:lst[ix] != item; 15, block; 16, identifier:bisect; 17, identifier:ix; 18, call; 19, subscript; 20, identifier:item; 21, expression_statement; 22, attribute; 23, argument_list; 24, identifier:lst; 25, identifier:ix; 26, assignment; 27, identifier:bisect; 28, identifier:bisect_left; 29, identifier:lst; 30, identifier:item; 31, subscript; 32, list; 33, identifier:lst; 34, slice; 35, identifier:item; 36, identifier:ix; 37, identifier:ix
code: def insort_no_dup(lst, item):
      """
      If item is not in lst, add item to list at its sorted position
      """
      import bisect
      ix = bisect.bisect_left(lst, item)
      if lst[ix] != item: 
          lst[ix:ix] = [item]