Correction on Page 93 (in-order traversal)
Nobody has claimed this yet.
Assessment
- Difficulty
- 1/5
- Estimated time
- Under an hour
- Newbie friendliness
- 85/100
- Issue type
- Documentation
- Clarity
- Clearly specified
- Activity status
- Stale
- Tech stack
- latex
- Domain
- documentation
Research direction
Find the PDF source file (likely a .tex file) that generates page 93. Locate the paragraph describing in-order traversal and replace the incorrect description with the corrected version provided in the issue. Verify the change by recompiling the PDF and checking that the correction appears on page 93.
Written by the indexing model from the issue text.
Description
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
- Dominant language
- TeX
- Stars
- 6
- Forks
- 3
- PR merge metrics
- No merged PRs in 30d
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
More from aalhour/graphbook
-
auto-migrated Priority-Medium Type-Defect
Difficulty 1/5 Under an hour Newbie friendliness 75/100
-
Difficulty 1/5 Under an hour Newbie friendliness 30/100
-
auto-migrated Priority-Medium Type-Defect
Difficulty 2/5 1-3 hours Newbie friendliness 55/100
-
auto-migrated Priority-Low Type-Enhancement
Difficulty 3/5 1-2 days Newbie friendliness 45/100
All issues in aalhour/graphbook
Similar issues
-
user-reported
Difficulty 2/5 1-3 hours Newbie friendliness 85/100
Kong/developer.konghq.com#7316 ·
-
Difficulty 2/5 1-3 hours Newbie friendliness 88/100
HarperFast/skills#96 ·
-
Difficulty 2/5 1-3 hours Newbie friendliness 82/100
infinispan/infinispan#18150 ·
-
bug triage:deciding
Difficulty 1/5 Under an hour Newbie friendliness 88/100
open-telemetry/otel-arrow#4132 ·
-
Ecosystem: ClawMetry — the Qwen Code reader is now free and open source (follow-up to #9294 / #9338) Opencategory/integration priority/P3 scope/documentation status/ready-for-human type/feature-request
Difficulty 1/5 Under an hour Newbie friendliness 84/100