Suppose the values 10, −4, 15, 30, 20, 5, 60, 19 are inserted in that order…

Suppose the values 10, −4, 15, 30, 20, 5, 60, 19 are inserted in that order into an initially empty binary search tree. Let 𝑇 be the resulting binary search tree. The number of edges in the path from the node containing 19 to the root node of 𝑇 is ___________. (Answer in integer)