First off, thank you for an excellent resource. Great work!
What steps will reproduce the problem?
- Browse to page 93 of pdf copy.
- See the paragraph about in-order traversal.
What is the expected output? What do you see instead?
- I see: Given a binary tree T having at least one vertex, in-order traversal
first visits the root of T and consider its left- and right children. We then
recursively apply in-order traversal to the left and right subtrees of the root
vertex.
- Shouldn't it be something like: Given a binary tree T having at least one
vertex, in-order traversal recursively traverses the left-subtree of the root,
the root of T and then its right subtree.
What version of the product are you using? On what operating system?
- 0.8-r1991 which is the latest as of 10/29/2014.
Please provide any additional information below.
- none
Original issue reported on code.google.com by kedar.mh...@gmail.com on 29 Oct 2014 at 10:41
Original issue reported on code.google.com by
kedar.mh...@gmail.comon 29 Oct 2014 at 10:41