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 …

Tree Traversal – inorder, preorder and postorder In this tutorial, you will learn about different tree traversal techniques. Also, you will find working examples of different tree traversal methods in C, C++, Java and Python. Traversing a tree means visiting every node in the tree. You might, for instance, want to add all the …

Tree Data Structure In this tutorial, you will learn about tree data structure. Also, you will learn about different types of trees and the terminologies used in tree. A tree is a nonlinear hierarchical data structure that consists of nodes connected by edges. A Tree Why Tree Data Structure? Other data structures such as …

Decrease Key and Delete Node Operations on a Fibonacci Heap In this tutorial, you will learn how decrease key and delete node operations work. Also, you will find working examples of these operations on a fibonacci heap in Python. In a fibonacci heap, decrease-key and delete-node are important operations. These operations are discussed below. …

Fibonacci Heap In this tutorial, you will learn what a Fibonacci Heap is. Also, you will find working examples of different operations on a fibonacci heap in Python. Fibonacci heap is a modified form of a binomial heap with more efficient heap operations than that supported by the binomial and binary heaps. Unlike binary …

Heap Data Structure In this tutorial, you will learn what heap data structure is. Also, you will find working examples of heap operations in Python. Heap data structure is a complete binary tree that satisfies the heap property. It is also called as a binary heap. A complete binary tree is a special binary tree in …

Hash Table In this tutorial, you will learn what hash table is. Also, you will find working examples of hash table operations in Python. Hash table is a data structure that represents data in the form of key-value pairs. Each key is mapped to a value in the hash table. The keys are used for indexing …

Types of Linked List – Singly linked, doubly linked and circular In this tutorial, you will learn different types of linked list. Also, you will find implementation of linked list in C. Before you learn about the type of the linked list, make sure you know about the LinkedList Data Structure. There are three common …