algorithm - 二叉树前序访问伪代码

Question

已经在网上搜索了5个多小时，找不到通用的BT预购访问伪代码。 提前致谢。 我只是找到像这样的短伪代码

 Algorithm postorder(T, v)
 Input: A binary tree T and a node v of T.
 Output: Depends on the action performed on a visit to a node.
  if T.hasLeft(v)
  postorder(T, T.left(v))   // recursively traverse left subtree
 if T.hasRight(v)
   postorder(T, T.right(v))  // recursively traverse right subtree
visit node v

Answer 1

前序、中序和后序之间的区别只是访问节点的顺序，相对于子节点:

你发布了这个:

 Algorithm postorder(T, v)
 Input: A binary tree T and a node v of T.
 Output: Depends on the action performed on a visit to a node.

 if T.hasLeft(v)
   postorder(T, T.left(v))   // recursively traverse left subtree
 if T.hasRight(v)
   postorder(T, T.right(v))  // recursively traverse right subtree
 visit node v

要改变行为，改变执行顺序。这是一些通用代码:

任意订单:

AnyOrder(T, v, order)

    if order is 'pre'
        visit(v)

    AnyOrder(T, T.left(v), order)

    if order is 'in'
        visit(v)

    AnyOrder(T, T.right(v), order)

    if order is 'post'
        visit(v)