if(TopOfStack==0) flag←1; } }while(flag==0) } ProcessCross();// 处理交叉点 TreeShape();// 交叉点形成树结构,每段边缘的跟踪止于叶子节点 VisitTree();// 遍历树结构,形成最终的边缘跟踪数组 else// 整个跟踪过程无交叉点出现 { Borderpoint←bpoint; } 4 实验结果及分析 海岸线是非常典型的...
The leftmost and the rightmost node of the binary tree are leaf nodes. They will get printed while performing the left boundary and the right boundary traversal while printing the leaf nodes. To avoid it, exclude the leaf nodes while doing the left boundary and the right boundary traversal. F...