## Relationship between number of nodes and height of binary tree

Prerequisite – Binary Tree Data Structure In this article, we will discuss various cases for relationship between number of nodes and height of binary tree.… Read More »

Prerequisite – Binary Tree Data Structure In this article, we will discuss various cases for relationship between number of nodes and height of binary tree.… Read More »

Prerequisite – Introduction of Set theory, Set Operations (Set theory) For a given set S, Power set P(S) or 2^S represents the set containing all… Read More »

In this article, we are discussing how to find number of functions from one set to another. For understanding the basics of functions, you can… Read More »

A graph is a data structure that is defined by two components : A node or a vertex. An edge E or ordered pair is… Read More »

Prerequisite – Relational Model Introduction and Codd Rules Any subset of attributes of a table that can uniquely identify all the tuples of that table… Read More »

A set of operations is said to be functionally complete or universal if and only if every switching function can be expressed by means of… Read More »

Problem 1 – There are 25 telephones in Geeksland. Is it possible to connect them with wires so that each telephone is connected with exactly… Read More »

Switching algebra is also known as Boolean Algebra. It is used to analyze digital gates and circuits It is logic to perform mathematical operation on… Read More »

A Boolean function is described by an algebraic expression consisting of binary variables, the constants 0 and 1, and the logic operation symbols For a… Read More »

Prerequisite – Graph Theory Basics Given an undirected graph, a matching is a set of edges, such that no two edges share the same vertex.… Read More »

Prerequisite – Generalized PnC Set 1 Combinatorial problems can be rephrased in several different ways, the most common of which is in terms of distributing… Read More »

Prerequisite – PnC and Binomial Coefficients So far every problem discussed in previous articles has had sets of distinct elements, but sometimes problems may involve… Read More »

Prerequisite – Combinatorics Basics Several Counting problems require finding the number of ways to arrange a certain number of distinct elements, where the relative order… Read More »

Combinatorics is the branch of Mathematics dealing with the study of finite or countable discrete structures. It includes the enumeration or counting of objects having… Read More »

Prerequisite – Graph Theory Basics Certain graph problems deal with finding a path between two vertices such that each edge is traversed exactly once, or… Read More »