threaded binary tree????
小弟正在学数据结构,书上对threaded binary tree的解释 让我很找不着北
"the rule: if a node has a NULL left child, we make its left child point to its inorder predecessor, and if a node has a NULL right child,we make its right child point to its inorder successor."
这个inorder predecessor 和 inorder successor到底指哪个node呢 能不能麻烦用树的图示给个说明呢。