Category Archives: Data Structure

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 Landis and they… Read More »

DSA Binary Search Tree

A Binary Search Tree is a special Binary tree (each parent node can have maximum 2 node), which satisfy the following condition. The tree must be a binary search tree. The left sub-tree key value should be less than the parent node key value. The right-sub tree key value should be greater than the parent node key value.

Tree Traversal

Traverse is one of the basic operations we apply to each data structure. In traverse, we visit every element or node of the data structure, traverse also help in searching operation when we have linear searching. Here we have provided a brief description and a python implementation of traverser operation on a binary tree.

What is Sorting

What is Sorting? In Sorting Algorithms, we arrange the elements in a specific order it could be ascending or descending. We apply sorting algorithms on those data structures which are iterable, and most often which contain numeric data types. Though the sorting could be in any order, often we ordered our data structures element into numerical or lexicographical… Read More »