Tree Preservation Orders in Burgh St Peter
Burgh St Peter is a village in Norfolk with 10 Tree Preservation Orders within 2km of the centre. TPOs in this area are managed by South Norfolk District Council.
TPO details
QU0YHTOQ00300— Area
South Norfolk District CouncilS5AICLOQ07S01— Area
South Norfolk District CouncilS5AIE8OQ07S00— Area
South Norfolk District CouncilS5AIGJOQ07S01— Area
South Norfolk District CouncilS5AIHGOQ07S01— Area
South Norfolk District CouncilS5AIC1OQ07S01— Area
South Norfolk District CouncilS5AIBKOQ07S01— Area
South Norfolk District CouncilS5AIAZOQ07S01— Area
South Norfolk District CouncilS5AI7MOQ07S00— Area
South Norfolk District CouncilS5AI9XOQ07S01— Area
South Norfolk District 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 Burgh St Peter?
Yes. We found 10 TPO records within 2km of Burgh St Peter centre.
How do I check for TPOs near Burgh St Peter?
Enter your postcode in our search tool to see TPOs near Burgh St Peter plotted on an interactive map. Burgh St Peter falls within South Norfolk District Council, which has data in our dataset. Results show Tree Preservation Orders within 200m of your postcode centroid.
Which planning authority covers Burgh St Peter?
Burgh St Peter falls within South Norfolk District Council. This planning authority is responsible for making and enforcing Tree Preservation Orders in the area.
What happens if I do work on a TPO tree near Burgh St Peter?
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.