.Find max distance between any two nodes of a binary tree with at most a single bent.

  • 0

    We need to find the distance between two nodes in Binary Tree with one bent. Let L=> Left R=>Right .
    Bent actually denotes LLLLLLLRRRRR in this case there is only one bent , LLLRRRLLLL there is two bent,
    RRRRRLLLLL only one bent .

Log in to reply

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.