Deletion from a B-tree   In this tutorial, you will learn how to delete a key from a b-tree. Also, you will find working examples of deleting keys from a B-tree in C, C++, Java and Python. Deleting an element on a B-tree consists of three main events: searching the node where the key to be …

Insertion into a B-tree   In this tutorial, you will learn how to insert a key into a btree. Also, you will find working examples of inserting keys into a B-tree in Python. Inserting an element on a B-tree consists of two events: searching the appropriate node to insert the element and splitting the node if required.Insertion operation always …

B-tree In this tutorial, you will learn what a B-tree is. Also, you will find working examples of search operation on a B-tree in Python. B-tree is a special type of self-balancing search tree in which each node can contain more than one key and can have more than two children. It is a generalized …

AVL Tree   In this tutorial, you will learn what an avl tree is. Also, you will find working examples of various operations performed on an avl tree in C, C++, Java and Python. AVL tree is a self-balancing binary search tree in which each node maintains extra information called a balance factor whose value …

Binary Search Tree (BST)   In this tutorial, you will learn how Binary Search Tree works. Also, you will find working examples of Binary Search Tree in Python. Binary search tree is a data structure that quickly allows us to maintain a sorted list of numbers. It is called a binary tree because each tree …

Balanced Binary Tree   In this tutorial, you will learn about a balanced binary tree and its different types. Also, you will find working examples of a balanced binary tree in Python. A balanced binary tree, also referred to as a height-balanced binary tree, is defined as a binary tree in which the height of …

Perfect Binary Tree   In this tutorial, you will learn about the perfect binary tree. Also, you will find working examples for checking a perfect binary tree in C, C++, Java and Python. A perfect binary tree is a type of binary tree in which every internal node has exactly two child nodes and all …

Full Binary Tree   In this tutorial, you will learn about full binary tree and its different theorems. Also, you will find working examples to check full binary tree in Python. A full Binary tree is a special type of binary tree in which every parent node/internal node has either two or no children. It …

Binary Tree   In this tutorial, you will learn about binary tree and its different types. Also, you will find working examples of binary tree in Python. A binary tree is a tree data structure in which each parent node can have at most two children. For example: In the image below, each element has …