deletions | additions       diff --git a/section_Challenegs_in_Bushy_Trees__.tex b/section_Challenegs_in_Bushy_Trees__.tex  index 9c2f32c..98292b5 100644  --- a/section_Challenegs_in_Bushy_Trees__.tex  +++ b/section_Challenegs_in_Bushy_Trees__.tex 
...
\section{Challenegs in Bushy Tree Implementation}  Moving from left-deep tree to a Bushy tree is a challenge as the number of possible structures in bushy trees are much larger. Left-deep trees have only one structure regardless of the number of attributes involved. Therefor the number of possible permutations are N! . But for bushy trees possible number of structures are given by   $$f(x) = \begin{cases}   0 & \text{if $0 < x \le 0.05$}; \\  0.1 & \text{if $0.05 < x \le 1$}; \\