Traversing hierarchy data in T-SQL using queues

A few days ago to see the "the Guru's Guide to Transact SQL" (Chinese translation is a Transact-SQL authoritative guide), which describes a query is about the hierarchy, the way to deal with the nature of the queue, traversal of the result is like traversing the binary tree in the first sequence traversal, very interesting.

The table structure to be queried is as follows:

Each layer node assigns a unique ID, the name of the node, and the ID of the previous parent node. Now, to find all the child nodes under the specified node ID, for example, for a node with ID 3, its query result ID set is {5,6,7,8,9,10,11,12,13}. Here is the key, write a stored procedure for easy reuse.