2025 Data Structures Using Python

Explain arrays as fixed-size containers of a single data type, with four-element example. Show how to create a one-dimensional array in Python by importing from array and initialize its type.

Access 1d array elements by index using a sample integer array [10, 20, 30, 40, 50], demonstrating zero-based indexing and retrieving values like 10 and 30.

Perform the update operation on a one-dimensional integer array by replacing the element at index 2 with 80, then display the updated sequence 10, 20, 80, 40, 50.

Delete a row from a two dimensional array (t[3]) and then iterate through the remaining rows and their columns to display the content.

Learn Python list indexing and slicing with zero-based and negative indices, practice accessing last elements and lengths, and create sublists and lists with alternate elements through slicing.

Learn how to use Python list methods to manipulate data, including append, clear, copy, count, extend, index, insert, pop, remove, reverse, and sort, with practical examples.

Learn how to manipulate tuples by converting to lists, performing append and pop operations, updating items by index, and converting back to tuples for final results.

Use for loops to access dictionary elements, print key–value pairs with items, and fetch values by key, while exploring keys and values methods.

Learn how to write and call Python functions, use parameters and a documentation string, return values (including square and multiply results), and return multiple values as tuples.

Learn to implement factorial in Python with both iterative and recursive functions, using a for loop and a base case in recursion, verifying with input 5 returning 120.

Apply the two-pointers approach to find the middle element of a linked list. Move slow by one and fast by two until fast ends, yielding the middle or second middle.

Learn to implement a Python linked list with Node and LinkedList classes, append nodes at the end, and traverse to find and return the maximum value.

Learn to check if expressions are balanced using a Python stack: push left brackets, pop on right, and verify matching types for (), [], and {}.

Use Python's built-in queue module to implement a queue with a max size, insert items with put, check full and empty states, and remove items with get while tracking size.

Learn tree terminology, defining a tree as a recursively defined node set with a root, and identify leaf nodes, degree as children, and height as the longest root-to-deepest path.

Explain binary tree traversals by teaching in-order, preorder, and postorder methods, detailing left subtree, root node, and right subtree with simple traversal steps.

Learn to compute the sum of all elements in a binary tree using a recursive add function. Traverse root, left, and right to accumulate node keys.

Learn how to search for elements in a binary search tree using recursive traversal of left and right subtrees, with base cases for empty trees and key matches.