Data Structures

In Python, a data type is a classification that specifies the type of value a variable can hold. Python is a dynamically-typed language, which means that the type of a variable is determined at runtime based on the value it holds. Python has several built-in data types such as numeric…

Algorithms are crucial in computer science and programming, forming the basis for efficient problem-solving and code optimization. Time complexity is key to analyzing algorithms, indicating how execution time grows with input size. This article focuses on linear time complexity (O(n)) and explores the linear search algorithm as a real-world example. …

1. Problem You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security systems connected and it will automatically contact the police if two adjacent houses…

Sure, I can teach you how to invert a binary tree! Inverting a binary tree means swapping the left and right subtrees of every node in the tree. Here’s an example of what inverting a binary tree looks like: 4…

Implementing a binary tree in Python can be done using classes and objects. Here is an example of a binary tree class: class Node: def __init__(self, data): self.left = None self.right = None self.data = data class BinaryTree: def __init__(self, data): self.root = Node(data) In this example, we define two…

In the first part, I talked about Redis and how it can help us to overcome some GeoSpatial challenges. However, Redis is a robust and helpful technology, and I think it’s better to have a whole article discussing its basic concepts, data structures, and some common use cases. It’s a key-value database. When discussing…

Trees are a common data structure with many implementations for specific use cases. One such implementation is called the “Trie”. Don’t ask me what the proper pronunciation is — I pronounce it the same as “tree” (works better for the title). In contrast to other implementations, a Trie is primarily…

linked list may be LIFO (last-in-first-out) or FIFO (first-in-first-out). If the list is using the LIFO method, the nodes will be added to and deleted from the same end. If it’s using FIFO, nodes will be added to one end and deleted from the opposite end. …