Trees - Height P61120


Statement
 

pdf   zip

html

Write a program that reads the shape of various binary trees, and prints the height of each one. We define the height of a tree as the maximal number of nodes of the paths that go from the root to each leaf (or zero, if the tree is empty).

Input

Input starts with m, the number of trees that must be treated. The description of the m trees follow as explained at problem "Trees — Recursive traversal", with an exception: All the values are 0, because the content of the nodes here is not important.

Output

Your program must print the height of each given tree.

Public test cases
  • Input

    2
    
    0 0 0 -1 0 -1 -1 0 -1 -1 0 0 -1 -1 0 0 -1 0 -1 -1 -1
    0 -1 0 -1 0 -1 -1
    

    Output

    5
    3
    
  • Information
    Author
    Jordi Petit i Salvador Roura
    Language
    English
    Translator
    Jordi Petit
    Original language
    Catalan
    Other languages
    Catalan
    Official solutions
    C++ Python
    User solutions
    C++ Python