Data structure is used in many things but a lot of people don’t realize it. Data structures has a lot of use wether its for the code and functions or interviews you will do or solving problems in mathematical way. There are a lot of structures out there that may…

blocks and statement conditions for Python. For Python code blocks begins and end with indentations as for other languages we use {} brackets, parenthesis ()or other symbols Python code is all about simplicity and cleanliness. …

Simple ways to learn and remember variables and types in Python. Everything in programming is stored in computer memory. The Data that we need are also stored in memory, variables is giving name to that certain area of memory where we can store certain values wether its string, numbers, list…

As I said from the previous blog python is a very simple program that can process complex functions or actions that need to be done. For this blog will cover the most basic actions that can be done in python. Literal is a value of some type. There is numerical…

Python is an object-oriented interpreted language that is easy to use. which can run on Windows, Linux, and Mac OS X plus more. The creator of python is Guido van Rossum who was an employee of google while he was creating the python language. Python supports basic data types such as numbers and strings. Also more complex types such as lists and dictionaries(which is similar to arrays and hashes for other languages).

any function that can be map data and store data to a hash table.

Hash tables are used to store key-value pairs. A structure that can map keys and values. It’s great to use because it is fast to map, add, and delete value. A key and value will be paired together to have a specific location. When finding a key the value will be returned. For example in banks they account number which is the key and the value is the information inside the accounts that is stored. It is easier to find and store.

Similar to binary search trees but with different set of rules. There are two different Binary heaps Max Binary Heap which has the largest value on the root node and parent node should always be larger than child node. 2. Min Binary Heap which is the opposite of the max. The root node is the Lowest value and the parent node is always larger than the child node.

The process of visiting each node in a tree data structure exactly once. Traversals are classified on which order the nodes are visited. The order of the numbers doesn’t need to be like a Binary search tree. It can be all jumbled and still be a tree graph in which it is not order lower from the left and higher to the right. There are many ways of traversing a tree. There is Breadth first search which will start from the root going down to each node until the last node that is in the bottom. It should go across the siblings. For example.