|All-time Popular Problems|
|Maximum difference between node and its ancestor|
|Delete a node from BST|
|K’th smallest element|
|Detect cycle in a directed graph|
|Element with left side smaller and right side greater|
|Sort The Array|
|Level order traversal Line by Line|
|Add two numbers represented by linked lists|
|Root to leaf path sum|
Given a special binary tree of size N, whose leaf nodes are connected to form a circular doubly linked list, your task is to complete the function findTreeHeight(), that should return the height of the tree.
1 / \ 2 3 / \ 4 5 / 6
In the above binary tree, 6, 5 and 3 are leaf nodes and they form a circular doubly linked list. Here, the left pointer of leaf node will act as a previous pointer of circular doubly linked list and its right pointer will act as next pointer of circular doubly linked list.
The function a single argument as input, the reference pointer to the root of the binary tree.
There will be T test cases and for each test case the function will be called separately.
For each test the function should return the height of the spiral binary tree.
1 2 L 1 3 R 2 4 L
1 2 L 1 3 R 2 4 L 2 5 R 4 6 L
Note:The Input/Ouput format and Example given are used for system's internal purpose, and should be used by a user for Expected Output only. As it is a function problem, hence a user should not read any input from stdin/console. The task is to complete the function specified, and not to write the full code.