>> What I'm calling a "binary tree" here is normally called a binary search tree. > This is because it associates keys with values. Standard binary trees usual

>> What I'm calling a "binary tree" here is normally called a binary search tree. > This is because it associates keys with values. Standard binary trees usually skip the values. Don't think so. A Binary Search Tree is a Binary Tree in which an inorder traversal goes through the data -- keys, in this case -- in sorted order. Of course, usefulness dictates that keys typically have associated values, but they do not have to be there, for it to be a BST. (Why have keys with no associated values? That's one way to represent a set.)