When we add a reference to the parent node in the binary tree node, the operations don't have to start from the root node. The action can start from the current node. It can go up or down the tree. The time complexity reduces from O(h) to O(1). This makes the search more efficient. However adding the parent reference need more work in insertion or deletion.