Describe the structure of a binary search tree containing the integers 15, 10, 20, 8, 12, 17, and 25. Do not use code, diagrams, or symbols. Use only indentation and directional phrases (such as 'left child of' or 'right child of') to explain the hierarchy and the placement of every number within the tree.