Python implementation: Insertion, Traversal, Search Interview Question Given a sorted (increasing order) array, write an algorithm to create a binary tree with minimal height.

Read More## Balanced parentheses

Given strings of brackets, determine whether each sequence of brackets is balanced. If a string is balanced, return YES. Otherwise, return NO.

Read More## Andela Qualified.io assessment: Question 2

Task Given the following class: complete the function which compares the two trees defined by TreeNodes a and b and returns true if they are equal in structure and in value and false otherwise. My solution My tests

Read More## Linked list

A linked list is made up of a node that links to the next.

Read More## Binary Trees

Trees are hierarchical data structures. Like linked lists, trees are made up of nodes. A common kind of tree is a binary tree, in which each node contains a reference to two other nodes the left and right subtrees. Like list nodes, tree nodes also …

Read More## QUEUES – Beginner implementation in Python

Queue is a linear structure which follows a particular order in which the operations are performed. The order is First In First Out (FIFO). Implementation in Python

Read More## STACKS – Beginner implementation in Python

A stacks is a data structure that allows adding and removing elements in a particular order. This order is normally Last In First Out (LIFO) It has the basic operations of inserting(push) and deleting(pop). Both insertion and removal are allowed at only one end of …

Read More