NICEBTRE - Nice Binary Trees
Binary trees can sometimes be very difficult to work with. Fortunately, there is a class of trees with some really nice properties. A rooted binary tree is called “nice”, if every node is either a leaf, or has exactly two children.
For example, the following tree is nice,
but the following tree is not.
The leaves of a nice binary tree are labeled by the letter ‘l’, and other nodes are labeled by the letter ‘n’.
Given the pre-order traversal of a nice binary tree, you are required to find the depth of the tree.
1. The depth of a tree is defined as the length of the longest path with one end at the root.
2. The pre-order traversal of the tree in the first image above produces the string “nlnnlll”.
The first line contains the number of test cases T. T lines follow. Each line contains a string, which represents the pre-order traversal of a “nice” binary tree. Leaves are represented by the letter ‘l’ and other nodes by the letter ‘n’. The input is guaranteed to be the preorder traversal of a nice binary tree.
Output one line for each test case, containing a single integer, the depth of tree.
0 < T < 20
Length of the input string in each test case is at most 10000.
Input: 3 l nlnll nlnnlll Output: 0 2 3
AC in one go!
Nice problem!Last edit: 2017-11-09 15:48:20
Nice problem!! O(n)!
Last edit: 2016-08-19 12:48:50
Easy recursion !! AC in 0.00 in first go.
I loved this question, although the test cases are weak. I have read the comments and tried to find a non recursive solution, but after a couple of WA I decided to do it recursively then I've got AC.Last edit: 2016-08-07 07:05:13
Loved the question :D .. But took me 4 hrs to solve :( ... No recursion needed
u can use stack if recursion tle
Nice question! Took me a bit of thinking but got AC in one go. I probably should practise more.
it's weird my code gives right on 100's of test cases and the "stereotype"code gives RE for nnlnnlnlll still stereotype passes!!!???