摘要：Scheme实现:(define (subsets s) (define nil '()) (if (null? s) (list nil) (let ((rest (subsets (cdr s)))) (append rest (map (lambda (i... 阅读全文

摘要：介绍二叉树的非递归算法（利用栈和父节点），实现相比较来说较为简单，代码更加简洁，逻辑清晰一、先序遍历栈模拟实现void PreorderTraversal(BinaryTree T){ stack S; while (T != nullptr || !S.empty()) { ... 阅读全文