deletions | additions       diff --git a/section_Challenegs_in_Bushy_Trees__.tex b/section_Challenegs_in_Bushy_Trees__.tex  index 5516af9..c987030 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   $$ S(N) $$S(N)  = \begin{cases} 1 & \text{if $N = 1$}; \\  \sum_{i=1}^{N} & \text{if $N \ne 0$};.\end{cases} $$ \\