GATE DA Python Data Structures & Collections | Set 1

Consider the following Python class definition for a Linked List node:

class Node:
    def __init__{self, val}:
        self.val = val
        self.next = None

head = Node(10)
head.next = Node(20)
head.next.next = Node(30)

# Code:
curr = head
s = 0
while curr:
s += curr.val
curr = curr.next
print(s)

In a Circular Singly Linked List with head pointer, what is the value of last_node.next?

A Hash Table with 7 slots uses hash function h(k) = k % 7 with chaining. Keys inserted: 10, 17, 24, 31. What is the length of the linked list chain at index 3?

What is the worst-case time complexity of searching an element in an unbalanced Binary Search Tree (BST) with N nodes?

If the Preorder traversal of a tree is A B D E C and Inorder traversal is D B E A C, what is the leaf count of the tree?