Will u plz elaborate ur solution. give the algo to how to find all binary trees.
On Oct 2, 9:51 pm, "Harshal ..Bet oN iT!!" <[email protected]> wrote: > 2) We need to find the all complete binary trees using 3 of the (+,*,/,-) > at a time as internal nodes and n1,n2,n3,n4 as leaves, and then inorder > traversal of the tree. If it is 24 then success. > > 3)You can view the problem as contructing a binary tree at each stage, > either down or right. Count the number of leaf nodes formed for goal state, > it will be equal to number of paths taken to reach the goal. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
