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 .
Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.