Data structures are fundamental concepts for any software application and programming in general. It is an incredibly valuable skill set to serve you in your…

Algorithmic logic is crucial for computer science. It might sound complex for a beginner, but it is manageable upon further inspection. It is based on…

A BDD (Bryant 1986) or branching program is a data structure that is used to represent a Boolean function. On a more abstract level, BDDs…

A trie (Fredkin, 1960), also called digital tree and sometimes radix tree, is an ordered multi-way tree data structure that is used to store a…

In order to find middle element of linked list in one pass, you need to maintain two pointers, one increment at each node while other…

A binary tree is made of nodes, where each node contains a "left" pointer, a "right" pointer, and a data element. The "root" pointer points…

As discussed in the previous post, there are two types of data structures available to C and C++ programmers. One is already built into the…

The basic aim of mycplus.com website was to develop a website for students of C/C++ and data structures. There are lots of tutorials and source…