Tree: Preorder Traversal


Problem Statement :


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

Input Format

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

Constraints

1 <=  Nodes in the tree  <= 500

Output Format

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

Sample Input

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

1 2 5 3 4 6



Solution :



title-img


                            Solution in C :

In Java :


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

class Node {
    int data;
    Node left;
    Node right;
}

*/

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




In C ++ :




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




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 preOrder( struct node *root) {
    if(root == NULL){
        return;
    }
    else{
    printf("%d ",root->data);
    preOrder(root->left);
    preOrder(root->right);
    }
}




In python3 :



class node:
    def __init__(self, val):
        self.val = val
        self.left = None
        self.right = None

    def addleft(self, val):
        self.left = node(val)

    def addright(self, val):
        self.right = node(val)
"""
def parseInput(vals, root):
    if vals:
        val = vals.pop()
        if val:
            root.addleft(val)
            parseInput(vals, root.left)
        if vals:
            val = vals.pop()
            if val:
                root.addright(val)
                parseInput(vals, root.right)
"""
n = int(input())
vals = list(map(int, input().split()))
#vals = [6, 5, 3, 0, 0, 2, 0, 0, 4, 1]
vals.reverse()
root = node(vals.pop())

#parseInput(vals, root)


if n == 6:
    root.addleft(vals.pop())
    root.addright(vals.pop())
    root.left.addleft(vals.pop())
    root.left.addright(vals.pop())
    root.right.addleft(vals.pop())
if n == 15:
    root.addleft(vals.pop())
    root.addright(vals.pop())
    root.left.addleft(vals.pop())
    root.left.addright(vals.pop())
    root.right.addleft(vals.pop())
    root.right.addright(vals.pop())
    root.left.left.addleft(vals.pop())
    root.left.left.addright(vals.pop())
    root.left.right.addleft(vals.pop())
    root.left.right.addright(vals.pop())
    root.right.left.addleft(vals.pop())
    root.right.left.addright(vals.pop())
    root.right.right.addleft(vals.pop())
    root.right.right.addright(vals.pop())

#user code here:

"""
just implement the preorder method below.

root is of type node, which is defined as:

class node:
    def __init__(self, val):
        self.val = val
        self.left = None
        self.right = None
"""


def preorder(root):
    if root:
        print(root.val,end = ' ')
        preorder(root.left)
        preorder(root.right)

#end user code

preorder(root)
                        








View More Similar Problems

Queue using Two Stacks

A queue is an abstract data type that maintains the order in which elements were added to it, allowing the oldest elements to be removed from the front and new elements to be added to the rear. This is called a First-In-First-Out (FIFO) data structure because the first element added to the queue (i.e., the one that has been waiting the longest) is always the first one to be removed. A basic que

View Solution →

Castle on the Grid

You are given a square grid with some cells open (.) and some blocked (X). Your playing piece can move along any row or column until it reaches the edge of the grid or a blocked cell. Given a grid, a start and a goal, determine the minmum number of moves to get to the goal. Function Description Complete the minimumMoves function in the editor. minimumMoves has the following parameter(s):

View Solution →

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.

View Solution →

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

View Solution →

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

View Solution →

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

View Solution →