摘要： 中序遍历INORDER-TREE-WALK(x)if x != NIL INORDER-TREE-WALK(x.left) print x.key INORDER-TREE-WALK(x.right)查找TREE-SEARCH(x,k)if x == NIL or k == x.key return xif k < x.key return TREE-SEARCH(x.left, k)else return TREE-SEARCH(x.right, k)最大关键字TREE-MAXIMUM(x)while(x.right != NIL) ... 阅读全文