Question: I am developing a localhost project that keeps sending requests to your-mime-site.com. 

I have included these jquery plugins:

1. jQuery
2. jQuery.form
3. jQuery.validate
4. jQuery.ui

Everything else I have coded myself.

I have tried to use NetBeans to search the project for the string "your-meme-site" but it says that some lines are too long to be searched.

Does anybody know why or how this is happening?

Answer: 
You can use an accumulator (here, `depth`) to keep track of how deep you currently are in the tree - then create a number of spaces corresponding to the depth the line is at:

```
main = putStrLn $ printTree tree
data Tree = Empty | Node Int (Tree) (Tree) deriving (Show)
tree = Node 4 (Node 3 Empty (Node 2 Empty Empty)) Empty

printTree :: Tree -> String
printTree x = printTree' x 0 
  where 
    printTree' x depth = case x of
      Node num treeA treeB -> (replicate (2 * depth) ' ') ++ show num ++ "\n" ++ (printTree' treeA (depth + 1)) ++ "\n" ++ (printTree' treeB (depth + 1))
      Empty -> (replicate (2 * depth) ' ') ++ "Empty" 

```

Output:

```
*Main> main
4
  3
    Empty
    2
      Empty
      Empty
  Empty

```
Ok I think I got it to work. 

```
printTree :: Tree -> String                                                                                                                                                                                     
printTree x = printT 0 x                                                                                                                                                                                                                   

space x = take x $ cycle " "                                                                                                                                                                                    

printT :: Int -> Tree -> String                                                                                                                                                                                 
printT num x =                                                                                                                                                                                                  
  case x of                                                                                                                                                                                                     
    (Node o treeA treeB) -> show o ++                                                                                                                                                                           
                          "\n" ++                                                                                                                                                                               
                          space num ++                                                                                                                                                                          
                          printT (num+1) treeA ++                                                                                                                                                               
                          "\n" ++                                                                                                                                                                               
                          space num ++                                                                                                                                                                          
                          printT (num+1) treeB                                                                                                                                                                  
    Empty -> "Empty"  

```