摘要
利用非递归后序遍历算法访问二叉树,不仅能更好的理解二叉树中的每个结点是如何访问的;同时使"栈"的"后进先出"的特点得到充分的体现,更好的表达出"栈"的神奇之处。
Using the method of non recursive sequence abounded again after access to the binary tree,not only to a better understanding of each node in the binary tree is how to access;And make the'last in,first out'stack''fully reflected,the characteristics of better express the magical thing about this'stack'.
基金
安徽省省级质量工程精品资源共享课程"<数据结构>精品课程"研究成果
项目编号:2016gxx060
关键词
非递归后序遍历算法
访问
栈
after the recursive sequence through calendar calculation method
access
the stack
