Construct an expression tree from a given postfix notation and print the infix notation. The binary expression tree is a binary tree whose leaves are operands, such as constants or variable names, and the other Read more…
Given two binary trees, check whether the leaf traversals of both trees are the same or not. For example, the leaf traversals of the following binary trees are 4, 5, 6. A simple solution is Read more…
Given a binary tree, extract all its leaves into a doubly linked list, i.e., remove all leaf nodes from the binary tree and construct a doubly linked list out of them. The extraction should be Read more…
Write an efficient algorithm to fix the children-sum property in a given binary tree. The only operation allowed is an increment operation on the node’s value For a tree to satisfy the children-sum property, each Read more…
Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node. For example, the minimum depth Read more…