Algorithms and Data Structures

  • Profound Academy

    • Status
      • 1
        Implementation
      • 2
        Bitwise operations
      • 3
        Prefix Sums
      • 4
        Sliding window / Two pointers
      • 5
        Modular Arithmetic
      • 6
        Number Theory
      • 7
        Binary Search
      • 8
        Basic Sorting
      • 9
        Greedy Algorithms
      • 10
        Basic Dynamic Programming
      • 11
        Recursion
      • 12
        Linked LIst
      • 13
        Queue & Stack
      • 14
        Binary tree + BST
      • 15
        Divide & Conquer + Advanced Sorting
      • 16
        Heap
      • 17
        Hashing
      • 18
        Graph Representation

    • Maximum node in a Binary Search Tree

    Given an empty binary search tree with no nodes, you are asked to perform 3 kinds of queries:
    1. insert x - insert the value x in the BST
    1. max - print the maximum value in the BST
    1. print - print the BST in the in-order traversal order.
    Given q queries, you are asked to write a program to perform these queries.

    Input

    The first line of the input contains a single number q (1 ≤ q ≤ 1000).
    The next q lines contain queries. For all the insert queries the value of x does not exceed in absolute value.

    Output

    For each max query, the program should print the maximum value of the BST on a separate line.
    For each print query, the program should print the post-order traversal of the BST, where the values should be separated by a space.

    Examples

    Input
    Output
    7 insert 2 insert 1 max insert 0 max insert 4 print
    2 2 0 1 4 2
     

    Constraints

    Time limit: 1 seconds

    Memory limit: 512 MB

    Output limit: 1 MB

    To check your solution you need to sign in
    Sign in to continue