Preorder and Postorder Traversal of binary tree in Python

As you know trees are non-linear data structures so there are many different ways to traverse them you can either visit the root node first and then visit the left subtree or the right subtree first or you can traverse level by level, there are many possible ways to traverse a tree.

Read More →

Binary Tree in Python

A Binary Tree can be defined as a tree with each node having atmost two children, an empty tree is also a valid binary. Each node of the Binary tree consists of three main components

Read More →

C program to Implement Stack using Linked List

A stack is a linear data structure and follows the last in first out rule, in this tutorial, we will learn how to implement stack using Linked List in C programming language.

Read More →

Binary Search Program in C using Recursion

Binary Search is a type of searching algorithm which works on a sorted array. It finds the target value(T) by comparing the target value(T) with the middle element of the array.

Read More →

Find smallest and largest element in an array-C program

Arrays are easy just add square brackets and you get an array. At Least easier than array using linked lists anyways, In this tutorial we will learn how to find out the largest and smallest element of an array by making a C program.

Read More →

Size of an array using Recursion in C

Most of us have done a lot of C programs using recursion and Recursion is the only thing in programming which gives me nightmares but anyways today we will see another C program which we can make using recursion.

Read More →

Priority Queue Using Linked List in C

A priority queue can be thought of as a modified queue in which when an element has to be removed from the queue, the one with the highest priority is retrieved first. The priority of the element can be set based on various factors.

Read More →
Search
Adverstisement
Adverstisement