Tree Preservation Orders in Hayes Knoll
Hayes Knoll is a hamlet in Wiltshire within Wiltshire Council, the planning authority responsible for Tree Preservation Orders here.
Some Tree Preservation Orders shown sit just over Hayes Knoll's boundary in Swindon Borough Council. Hayes Knoll itself falls within Wiltshire Council.
TPO details
2008-01— 23 trees, 1 woodland
Swindon Borough CouncilNeed to work on a tree?
We can connect you with a vetted local tree surgeon or arborist.
Work with trees for a living? Get matched with local leads — free to join →TPO/2024/00029— Individual tree
Wiltshire CouncilOID-1900275— Individual tree
Wiltshire Council1987-01— 4 trees
Swindon Borough Council
This data is provided for informational purposes only and may not reflect the most up-to-date position. If you are planning work on or near a protected tree, you should contact your local planning authority to confirm the current status of any Tree Preservation Orders.
Frequently Asked Questions
Are there Tree Preservation Orders in Hayes Knoll?
We show 54 TPO records within 2km of Hayes Knoll centre, some of which fall just over the boundary in Swindon Borough Council.
How do I check for TPOs near Hayes Knoll?
Enter your postcode in our search tool to see TPOs near Hayes Knoll plotted on an interactive map. Results show Tree Preservation Orders within 200m of your postcode centroid.
Which planning authority covers Hayes Knoll?
Hayes Knoll falls within Wiltshire Council, which is responsible for making and enforcing Tree Preservation Orders in the area. Some TPOs shown on our map sit within 2km of the centre but fall under neighbouring Swindon Borough Council.
What happens if I do work on a TPO tree near Hayes Knoll?
Carrying out prohibited work on a TPO-protected tree without consent is a criminal offence. Destroying a protected tree can result in an unlimited fine. Other unauthorised work, such as lopping or topping, can result in a fine of up to £2,500. If you need to carry out work, apply to your local planning authority for consent first.