## Check if the level order traversal of a Binary Tree results in a palindrome

Given a binary tree and the task if to check if it’s level order traversal results in a palindrome or not. Examples: Input: Output: Yes… Read More »

- Convert a given Binary Tree to Circular Doubly Linked List | Set 2
- Calculate height of Binary Tree using Inorder and Level Order Traversal
- Flatten Binary Tree in order of Level Order Traversal
- Count all k-sum paths in a Binary Tree
- Check if the given n-ary tree is a binary tree
- Find the Deepest Node in a Binary Tree Using Queue STL - SET 2
- Sum of nodes in the left view of the given binary tree
- Convert ternary expression to Binary Tree using Stack
- Flatten binary tree in order of post-order traversal
- Duplicate subtree in Binary Tree | SET 2
- Find the color of given node in an infinite binary tree
- Find Maximum Level Sum in Binary Tree using Recursion
- Sum of nodes in the right view of the given binary tree
- Maximum XOR with given value in the path from root to given node in the tree
- Number of ways to divide a Binary tree into two halves
- Flatten Binary Tree in order of Zig Zag traversal
- Delete the last leaf node in a Binary Tree
- Convert a given Binary tree to a tree that holds Logical OR property
- Sink even nodes in Binary Tree
- Difference between General tree and Binary tree
- Skewed Binary Tree
- Extended Binary Tree

Given a binary tree and the task if to check if it’s level order traversal results in a palindrome or not. Examples: Input: Output: Yes… Read More »

Given a binary tree where node values are lowercase alphabets, the task is to find the lexicographically smallest diameter. A diameter is the longest path… Read More »

Given a Binary Tree, the task is to check whether the given binary tree is Binary Search Tree or not. A binary search tree (BST)… Read More »

Given a binary tree, the task is to find the bottom view of a binary tree using recursion. Examples: Input: 1 \ 2 \ 4… Read More »

Given 2 arrays, the first one containing postorder traversal sequence and the second one containing the information whether the corresponding node in the first array… Read More »

Given a tree and a node, the task is to find the parent of the given node in the tree. Print -1 if the given… Read More »

Given a positive integer N, the task is to find the count of edges of a perfect binary tree with N levels. Examples: Input: N… Read More »

Extended binary tree is a type of binary tree in which all the null sub tree of the original tree are replaced with special nodes… Read More »

A skewed binary tree is a type of binary tree in which all the nodes have only either one child or no child. Types of… Read More »

General Tree: In the data structure, General tree is a tree in which each node can have either zero or many child nodes. It can… Read More »

Given a Binary Tree (Every node has at most 2 children) where each node has value either 0 or 1. The task is to convert… Read More »

Given a binary tree, the task is to find the sum of the nodes which are visible in the left view. The left view of… Read More »

Given a Binary Tree having odd and even elements, sink all it’s even valued nodes such that no node with even value could be a… Read More »

Given a binary tree, the task is to find the sum of the nodes which are visible in the right view. The right view of… Read More »

Given a Binary Tree having positive and negative nodes, the task is to find the maximum sum level in it and print the maximum sum.… Read More »