DSA: Recursion

In Programming, we have a concept that is super important when we deal with the implementation of trees and graph data structure and it is called recursion. Recursion is a technique offered by many programming languages in which a user-defined function can call itself again and again until a base condition gets satisfied.

AVL Tree

AVL tree stands for Adelson-Velsky and Landis Tree and it is a self-balancing Binary Search tree. AVL tree is the extension of Binary Search tree Data Structure. It reduces the time complexity of the many operations of Binary Search Tree. The name of this tree Data Structure AVL is named after its inventor Adelson-Velsky and… Read More »

Python List Comprehension

In this tutorial, we will discuss python list comprehension, with some of its examples. List Comprehension List comprehension is a shorthand to create a list using for loop, within a line. With the help of List comprehension, we can easily create a list from existing iterable data objects (string, list, dictionary, tuple, and set). List… Read More »