MMIX Supplement to The Art of Computer Programming, Section 2.3.1, Traversing Binary Trees
	Content Home A Message from Donald Knuth Getting Started The MMIX Supplement Contributing Development Proposals Bug Reports Resources Sources Documentation Win32 Executables Linux 32 Bit Binaries MAC OSX Executables MMIXVD the Visual Debugger Patches, Extensions & Tools Examples Links Das MMIX Buch Virtual Motherboard Other Material MMIX at Munich University of Applied Sciences Impressum Privacy	Section 2.3.1 Traversing Binary Trees Program T, Traverse binary tree inorder Testcase Program S, Symmetric successor in a threaded binary tree Testcase Answers to the Exercises Exercise 20, Program T with stack in consecutive memory locations Testcase Exercise 20, skiping push(P) if LLINK(P)=0 Testcase Exercise 20, Program T with linked stack Testcase Exercise 20, with a linked stack skiping push(P) if LLINK(P)=0 Testcase Exercise 20, recursive Testcase Exercise 22 Testcase

Please help to keep this site up to date! If you want to point out important material or projects that are not listed here, if you find errors or want to suggest improvements, please send email to