#Data Structures

Given an array of integers sorted in non-decreasing order, find the starting and ending position of a target value. If the target is not found, return [-1, -1].

Implement functions to handle lock and unlock operations on an M-ary tree, ensuring proper hierarchy control as part of the Tree of Space problem, under the guidance of a mentor.

Discuss the differences between deep copy and shallow copy, including examples.