SDE - Intern

You are given an arbitrary binary tree consisting of N nodes where each node is associated with a certain value. You need to check whether the given tree is a sum tree or not.

A binary tree is a sum tree if the value of each node is equal to the sum of nodes present in the left and the right subtree. An empty tree is a sum tree with 0 sums. A leaf node is also considered a sum tree with a sum equal to the value of the leaf node.

You are given arrays 'inOrder' and 'postOrder', which represent 'inorder' traversal and 'postorder' traversal of a 'Binary Tree' respectively.

Construct a 'Binary Tree' represented by the given arrays and return it's head.

Note:

Assume that the Binary Tree contains only unique elements.

Example:

Input: 'inOrder' = [9, 3, 15, 20, 7], 'postOrder' = [9, 15, 7, 20, 3]

Output:
We get the following binary tree from Inorder and Postorder traversal:

You are given a binary tree. Apart from the left and right child pointers, each node in the given binary tree points to a random node in the given binary tree. You are supposed to return a clone of the binary tree.

Cloning a binary tree means making a deep copy of the input binary tree.

Note :

Two nodes may have the same value associated with them.
The root node will be fixed and will be provided in the function.

You are given two containers: one with a capacity of 3 litres and the other with a capacity of 5 litres. The water supply is infinite. Your task is to use these containers to measure exactly 4 litres of water. You can fill or empty the containers, as well as pour water from one container to another. The goal is to have exactly 4 litres of water in one of the containers at the end of the process.

Please note that the containers do not have any measurement markings, so you can only rely on their capacities (3 litres and 5 litres) to measure the desired quantity of water.