./Heap/MergeKSortedLists.py:50:16: F821 undefined name 'ListNode'
root = ListNode(heapq.heappop(a))
^
./Heap/MergeKSortedLists.py:54:25: F821 undefined name 'ListNode'
root.next = ListNode(heapq.heappop(a))
^
./Array/AddTowNumbersII.py:71:20: F821 undefined name 'ListNode'
node = ListNode(result[0])
^
./Array/AddTowNumbersII.py:82:18: F821 undefined name 'ListNode'
myNode = ListNode(get_value[0])
^
./Array/AddTowNumbersII.py:109:20: F821 undefined name 'ListNode'
root = ListNode(0)
^
./Array/AddTowNumbersII.py:113:24: F821 undefined name 'ListNode'
node = ListNode(0)
^
./Array/MergerTwoSortedList.py:28:22: F821 undefined name 'ListNode'
head = cur = ListNode(0)
^
./Array/KthLargestElementInAnArray.py:83:23: F821 undefined name 'l_r_m'
return sorted(l_r_m, key=lambda x: x[1])[1][0]
^
./Array/AddTwoNumbers.py:48:16: F821 undefined name 'ListNode'
root = ListNode(get_value[0])
^
./Array/AddTwoNumbers.py:59:24: F821 undefined name 'ListNode'
new_node = ListNode(get_value[0])
^
./Array/AddTwoNumbers.py:69:25: F821 undefined name 'ListNode'
root.next = ListNode(rest_value)
^
./Array/SumOfSubarrayMinimums.py:190:11: F821 undefined name 'b'
print(len(b))
^
./Array/SumOfSubarrayMinimums.py:191:25: F821 undefined name 'c'
print(a.sumSubarrayMins(c))
^
./Array/two_sum.py:45:18: F821 undefined name 'xrange'
for i in xrange(len(nums)-1, -1, -1):
^
./Tree/ConstructBinaryTreeFromPreorderAndPostorderTraversal.py:114:33: F821 undefined name 'TreeNode'
root.left = TreeNode(x[0])
^
./Tree/ConstructBinaryTreeFromPreorderAndPostorderTraversal.py:116:34: F821 undefined name 'TreeNode'
root.right = TreeNode(x[1])
^
./Tree/ConstructBinaryTreeFromPreorderAndPostorderTraversal.py:124:19: F821 undefined name 'TreeNode'
allRoot = TreeNode(pre[0])
^
17 F821 undefined name 'ListNode'
17