Description: Robson Traversal
Write and test a "modified" Robson Traversal program that uses the linked representation of the trees.
This modified version differs from the Robson only in that the pointers to a node s predecessor should
now be as in the Linked Inversion Traversal. That is, when a node s left(right) subtree is being traversed,
its left(right) pointer will point to its predecessor. During the traversal, when a node is visited, output
for each "stack entry, its info value and the info value of its left and right successors. This means, first,
output the number of the node Top points to, and then the number that that node s left and right pointers
point to. Then, output the number of the node that Stack points to,and then the numbers that that node s left
and right pointers point to. Do this for each node on the "stack"
- [Garwick] - This course project has finished a modif
- [Binary_Tree] - //Binary_tree.cpp : implementation file
File list (Check if you may need any files):
Robson
......\robson.h
......\robson_modified.cpp
......\tree1.txt
......\tree2.txt
......\tree3.txt
......\tree4.txt
Download