 It is possible to record the access path during the first pass for use during the second, but that requires extra space during the access operation.Another alternative is to keep a parent pointer in every node, which avoids the need for extra space during access operations but may reduce overall time efficiency because of the need to update those pointers.Another method which can be used is based on the argument that we can restructure the tree on our way down the access path instead of making a second pass.