# Tree: Postorder Traversal

### Problem Statement :

```Complete the postorder function in the editor below. It received 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's postorder traversal as a single line of space-separated values.

Input Format

Our test code passes the root node of a binary tree to the postorder function.

Constraints

1 <=  Nodes in the tree   <= 500

Output Format

Print the tree's postorder traversal as a single line of space-separated values.

Sample Input

1
\
2
\
5
/  \
3    6
\
4
Sample Output

4 3 6 5 2 1```

### Solution :

```                            ```Solution in C :

In Java :

void Postorder(Node root) {
if (root == null) { return; }
Postorder(root.left);
Postorder(root.right);
System.out.print(root.data + " ");
}

In C++ :

/* you only have to complete the function given below.
Node is defined as

struct node
{
int data;
node* left;
node* right;
};

*/

void Postorder(node *root) {
if (!root) return;
Postorder(root->left);
Postorder(root->right);
printf("%d ", root->data);
}

In C :

/* you only have to complete the function given below.
node is defined as

struct node {

int data;
struct node *left;
struct node *right;

};

*/
void postOrder( struct node *root) {
if(root==NULL){
return;
}
else{
postOrder(root->left);
postOrder(root->right);
printf("%d ",root->data);
}

}

In python3 :

"""
Node is defined as
self.left (the left child of the node)
self.right (the right child of the node)
self.data (the value of the node)
"""

def _preOrder(root, acc):
if root:
_preOrder(root.left, acc)
_preOrder(root.right, acc)
acc.append(root.data)

def postOrder(root):
acc = []
_preOrder(root, acc)
print(" ".join(map(str, acc)))
```

## Down to Zero II

You are given Q queries. Each query consists of a single number N. You can perform any of the 2 operations N on in each move: 1: If we take 2 integers a and b where , N = a * b , then we can change N = max( a, b ) 2: Decrease the value of N by 1. Determine the minimum number of moves required to reduce the value of N to 0. Input Format The first line contains the integer Q.

## Truck Tour

Suppose there is a circle. There are N petrol pumps on that circle. Petrol pumps are numbered 0 to (N-1) (both inclusive). You have two pieces of information corresponding to each of the petrol pump: (1) the amount of petrol that particular petrol pump will give, and (2) the distance from that petrol pump to the next petrol pump. Initially, you have a tank of infinite capacity carrying no petr

## Queries with Fixed Length

Consider an -integer sequence, . We perform a query on by using an integer, , to calculate the result of the following expression: In other words, if we let , then you need to calculate . Given and queries, return a list of answers to each query. Example The first query uses all of the subarrays of length : . The maxima of the subarrays are . The minimum of these is . The secon

## QHEAP1

This question is designed to help you get a better understanding of basic heap operations. You will be given queries of types: " 1 v " - Add an element to the heap. " 2 v " - Delete the element from the heap. "3" - Print the minimum of all the elements in the heap. NOTE: It is guaranteed that the element to be deleted will be there in the heap. Also, at any instant, only distinct element