this is for holding javascript data
Bhathiya edited section_Challenegs_in_Bushy_Trees__.tex
about 8 years ago
Commit id: 7808ad4bb17df90ed8cb83845ab6455d030bd194
deletions | additions
diff --git a/section_Challenegs_in_Bushy_Trees__.tex b/section_Challenegs_in_Bushy_Trees__.tex
index 84477b5..78c2660 100644
--- a/section_Challenegs_in_Bushy_Trees__.tex
+++ b/section_Challenegs_in_Bushy_Trees__.tex
...
\section{Challenegs in Bushy
Trees} 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