摘要:
转自:http://www.360doc.com/content/10/1220/17/4850421_79821534.shtml二叉树中序、后序和先序的递归遍历:inorder中序遍历:template<typename NT>void inorder(NT* root, void (*visit)(NT*)){ if(root != 0) { inorder(root->lc_, visit); //中序遍历左子树; visit(root); //访问根节点; inorder(root->rc_, visit); //中序遍历右子树; }}postorder后续遍 阅读全文
posted @ 2011-10-19 14:38
pojowsh
阅读(450)
评论(1)
推荐(0)
浙公网安备 33010602011771号