# LMD Async Tutoring **URL:** \ **Category:** Tutoring\ **Created:** [April 23, 2024, 12:05am UTC](https://discuss.criticalfallibilism.com/t/lmd-async-tutoring/1933 "2024-04-23T00:05:39Z")\ **Posts on this page:** 1\ **Showing post:** 362
**Author:** ![LMD](https://discuss.criticalfallibilism.com/user_avatar/discuss.criticalfallibilism.com/lmd/32/3213_2.png) [@LMD](https://discuss.criticalfallibilism.com/u/LMD)\ **Post date:** [July 12, 2024, 2:33am UTC](https://discuss.criticalfallibilism.com/t/lmd-async-tutoring/1933/362 "2024-07-12T02:33:34Z")
> [@Eternity Async Tutoring](https://discuss.criticalfallibilism.com/t/eternity-async-tutoring/1932/273): > > Try making trees from the expressions you were just talking about and see if this makes sense. Also try making trees for: > > 5+3\*2 > > (add 1 (multiply 8 4)) > > 7 \* 4-1 > > (multiply 6 (minus 5 3)) Okay, the 3 input XOR infix expression I did [here](https://discuss.criticalfallibilism.com/t/lmd-async-tutoring/1933/353) is: > (x^y^z)v(x^~y^~z)v(~x^y^~z)v(~x^~y^z) this in prefix: > or(and(x, y, z), and(x, not(y), not(z)), and(not(x), y, not(z)), and(not(x), not(y), z)) the tree of this: ![Screenshot 2024-07-12 at 12.20.35 PM](https://discuss.criticalfallibilism.com/uploads/default/original/2X/a/a61c2838adce9cba11004fae31218270f888d20a.png) 5 + 3 \* 2: ![Screenshot 2024-07-12 at 12.33.03 PM](https://discuss.criticalfallibilism.com/uploads/default/original/2X/9/9f7e71a1d3a0c0ff5b1f5b7e9c0a35ad76a34d1d.png) (add 1 (multiply 8 4)): ![Screenshot 2024-07-12 at 12.23.15 PM](https://discuss.criticalfallibilism.com/uploads/default/original/2X/c/c059f3dfa3333d6f8cb8d3fc7899430bee3a978d.png) 7 \* 4 - 1: ![Screenshot 2024-07-12 at 12.25.35 PM](https://discuss.criticalfallibilism.com/uploads/default/original/2X/3/30e3426d4e1c67564ab1b703a228c0e4915c9c24.png) (multiply 6 (minus 5 3)) ![Screenshot 2024-07-12 at 12.24.45 PM](https://discuss.criticalfallibilism.com/uploads/default/original/2X/9/9547aec305ca932585ede9defd646d9ee3ac75fb.png) Yes I can really see how much easier it is translating a prefix expression to a tree. With infix you have to read through the whole expression, consider the order of operations, and consider how to diagram it. With prefix you can just go left to right and you start with the highest level. Then you can drop down and back up as you go. --- _[View the full topic](https://discuss.criticalfallibilism.com/t/lmd-async-tutoring/1933)._