## Shannon-Fano Algorithm for Data Compression

DATA COMPRESSION AND ITS TYPES Data Compression, also known as source coding, is the process of encoding or converting data in such a way that… Read More »

- MakeMyTrip Interview Experience 2019
- Print nodes in the Top View of Binary Tree | Set 3
- Print the nodes of binary tree as they become the leaf node
- Zig Zag Level order traversal of a tree using single queue
- DFS traversal of a tree using recursion
- Shannon-Fano Algorithm for Data Compression
- Find the node with maximum value in a Binary Search Tree
- Insert a node in Binary Search Tree Iteratively
- Print path between any two nodes in a Binary Tree
- Iterative Method To Print Left View of a Binary Tree
- 2-3 Trees | (Search and Insert)
- Print all even nodes of Binary Search Tree
- Search a node in Binary Tree
- Count the Number of Binary Search Trees present in a Binary Tree
- Shortest root to leaf path sum equal to a given number
- Level Ancestor Problem
- Flatten a binary tree into linked list | Set-3
- Print all nodes between two given levels in Binary Tree
- Difference between graph and tree
- Zig-Zag traversal of a Binary Tree using Recursion
- Sum of nodes at maximum depth of a Binary Tree | Set 2
- Check whether a given binary tree is skewed binary tree or not?
- Count all Grandparent-Parent-Child Triplets in a binary tree whose sum is greater than X
- Sandvine Interview Experience for FTE 2018
- Check if the given Binary Tree have a Subtree with equal no of 1's and 0's
- Preorder Traversal of N-ary Tree Without Recursion
- Counting inversions in an array using segment tree
- Number of subarrays have bitwise OR >= K
- Some Basic Theorems on Trees
- Clockwise Spiral Traversal of Binary Tree

DATA COMPRESSION AND ITS TYPES Data Compression, also known as source coding, is the process of encoding or converting data in such a way that… Read More »

Given a Binary Tree, the task is to find the Coefficient of Range in it. Range is defined as the difference between the maximum and… Read More »

Given a binary tree and a node in the binary tree, find Levelorder successor of the given node. That is, the node that appears after… Read More »

Given a binary tree and a node in the binary tree, find Levelorder Predecessor of the given node. That is, the node that appears before… Read More »

Given an N-ary tree, print all the levels with odd and even number of nodes in it. Examples: For example consider the following tree 1… Read More »

Given a binary tree with as its root and for any parent its left child will be 2*i and right child will be 2*i+1. The… Read More »

Given a binary tree. First print all leaf nodes, after that remove all the leaf nodes from the tree and now print all the new… Read More »

Given a binary tree and two nodes of that binary tree. Find the sum of all nodes with odd values in the path connecting the… Read More »

Given an N-ary tree, print the number of leaf nodes in the subtree of every node. Examples: Input: 1 / \ 2 3 / |… Read More »

Given a Binary Tree of distinct nodes and a pair of nodes. The task is to find and print the path between the two given… Read More »

Given a Binary Tree with distinct nodes. Given two nodes node1 and node2, check if the two nodes lies in the same subtree of the… Read More »

Given a binary tree with distinct nodes and a pair of two nodes. The task is to find the XOR of all of the nodes… Read More »

Given a Binary Node and a node. The task is to search and check if the given node exits in the binary tree or not.… Read More »

Given a Binary Tree check whether it is skewed binary tree or not. A skewed tree is a tree where each node has only one… Read More »