## Inorder Non-threaded Binary Tree Traversal without Recursion or Stack

We have discussed Thread based Morris Traversal. Can we do inorder traversal without threads if we have parent pointers available to us? Input: Root of… 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
- Shortest root to leaf path sum equal to a given number
- Search a node in Binary Tree
- Level Ancestor Problem
- Flatten a binary tree into linked list | Set-3
- Count the Number of Binary Search Trees present in a Binary Tree
- Print all nodes between two given levels in Binary Tree
- Difference between graph and tree
- Sum of nodes at maximum depth of a Binary Tree | Set 2
- Check whether a given binary tree is skewed binary tree or not?
- Zig-Zag traversal of a Binary Tree using Recursion
- 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

We have discussed Thread based Morris Traversal. Can we do inorder traversal without threads if we have parent pointers available to us? Input: Root of… Read More »

Leaf traversal is sequence of leaves traversed from left to right. The problem is to check if leaf traversals of two given Binary Trees are… Read More »

Given a Binary Tree and a node x in it, find distance of the closest leaf to x in Binary Tree. If given node itself… Read More »

Paytm Hiring Drive for Backend Engineer. Selection process was completed on same day . Round 1 ( Written ): It was a technical written round… Read More »

Given an n-ary tree of resources arranged hierarchically such that height of tree is O(Log N) where N is total number of nodes (or resources).… Read More »

Given an array that represents Inorder Traversal, find all possible Binary Trees with the given Inorder traversal and print their preorder traversals. Examples: Input: in[]… Read More »

The article describes an approach to solving the problem of finding the LCA of two nodes in a tree by reducing it to a RMQ… Read More »

Given a Binary Tree, return following value for it. 1) For every level, compute sum of all leaves if there are leaves at this level.… Read More »

A Binary Tree is labeled if every node is assigned a label and a Binary Tree is unlabeled if nodes are not assigned any label.… Read More »

Round 1 (Coding round): 1) Range [L, R] is given. Need to find what is the maximum repeating digit in prime numbers between L and… Read More »

Given a binary tree, write a program to count the number of Single Valued Subtrees. A Single Valued Subtree is one in which all the… Read More »

Given an array of numbers, return true if given array can represent preorder traversal of a Binary Search Tree, else return false. Expected time complexity… Read More »

Given a binary tree we need to check it has heap property or not, Binary tree need to fulfill following two conditions for being a… Read More »

Given a Tree where every node contains variable number of children, convert the tree to its mirror. Below diagram shows an example. We strongly recommend… Read More »

A succinct encoding of Binary Tree takes close to minimum possible space. The number of structurally different binary trees on n nodes is n’th Catalan… Read More »