algorithm for making a red black tree from a binary search tree

Hi is there any clear algorithm that make a red black tree from a binary search tree? please help me thanks

From stackoverflow

• One way to do it is traverse the nodes in the binary tree, and add each one to a new red-black tree.