NerdyCoder | Trees

Construct a binary tree from inorder and postorder traversals

You are given inorder and postorder traversals, you need to construct the binary tree. Input : Inorder = {4, 8, 2, 5, 1, 6, 3,

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

You are given an array which is sorted in increasing order, you need to convert that array into a Binary Search Tree. Note that the

You are given a non-empty binary tree. You need to find out the number of leaf nodes present in the tree. Leaf nodes are those

You are given a binary tree, check whether it is symmetric or not. A symmetric tree is one if it is a mirror image of

You are given a non empty binary tree and a key value, you need to return the level of the node with the given key

« 1 2 3 »