Here is a curated list of top interview problems on binary trees. These are mostly asked in face to face technical interview rounds. The list
Tag: backtracking
Path sum equal to k in trees
You are given a binary tree which can have negative elements also and an integer k, you need to print all the paths in the
Permutations of a string using backtracking.
Given an array or a string, print all the permutations of it. A permutation of a string, is a rearrangement of the elements of the
Print all paths from Root to leaf.
You are given a binary tree, you need to print all the paths from root to leaf nodes. In the above figure, the paths from