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
      • 19
        BFS

    • Find the smallest difference in BST

    Given a binary search tree, you are asked to find the smallest difference between two different elements of the BST.

    Input

    The input is handled automatically, you don’t need to do anything. All the values of the nodes are positive integers that don’t exceed . It’s guaranteed that the input BST tree is valid and has more than 2 nodes.

    Output

    The program should print the minimum absolute smallest difference between two elements in the BST.

    Examples

    Input
    Output
    4 1 10 3 6
    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