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 C. 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 C. A balanced binary tree, also referred to as a height-balanced binary tree, is defined as a binary tree in which the height of …
Complete Binary Tree In this tutorial, you will learn about a complete binary tree and its different types. Also, you will find working examples of a complete binary tree in C. A complete binary tree is a binary tree in which all the levels are completely filled except possibly the lowest one, which is …
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. A perfect binary tree is a type of binary tree in which every internal node has exactly two child nodes and all the leaf nodes are …
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 C. 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 C. 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. Traversing a tree means visiting every node in the tree. You might, for instance, want to add all the values in the tree …
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 C. 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 C. 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 C. 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 …