human
Calculate depth of a full Binary tree from Preorder | function to return max of left subtree height or right subtree height.
calc height of left subtree ( In preorder left subtree is processed before right ).
calc height of right subtree.
Wrapper over findDepthRec ( ).
Driver program to test above functions"
Solution in Python:

=====
What is a code to calculate depth of a full Binary tree from Preorder and the other steps required?
assistant
#Here is code to calculate depth of a full Binary tree from Preorder and the other steps required.
 def findDepthRec ( tree , n , index ) :
	if ( index [ 0 ] >= n or tree [ index [ 0 ] ] == ' l ' ) :
		return 0
	index [ 0 ] += 1
	left = findDepthRec ( tree , n , index )
	index [ 0 ] += 1
	right = findDepthRec ( tree , n , index )
	return ( max ( left , right ) + 1 )
def findDepth ( tree , n ) :
	index = [ 0 ]
	return findDepthRec ( tree , n , index )
if __name__ == ' _ _ main _ _ ' :
	tree = " nlnnlll "
	n = len ( tree )
	print ( findDepth ( tree , n ) )