Unformatted text preview: threads pointing at them. What is the maximum number of threads that can point at a node? Describe the binary trees that can cause these situations to arise. 7. Describe how to ±nd the inorder predecessor of an arbitrary node P in a binary tree that is threaded in inorder. 8. Devise an algorithm to traverse a binary tree in inorder that does not make use of a stack or threads. You may temporarily change the values of the pointer ±elds during this process. However, at the end of the algorithm all pointer ±elds are to have the values they had prior to the invocation of the algorithm. You may make use of an additional onebit FLAG ±eld in each node for auxiliary storage. The following exercises from the “Notes on Data Structures” are optional. You are urged to look at them for practice. 6, 7, 8, 32, 33, 36, 37, 10, 11, 12, 13, 14, 15, 16, 17, 42, 43, 18, 19, 20, 21, 44, 45...
View
Full Document
 Fall '08
 staff
 leaf node

Click to edit the document details