binary tree and overlapping rectangles

1. Implement the following C++ function to determine if 2 rectangles overlap or touch each other. The rectangles run parallel to the x and y axes. |- width -| _________ _ | | | | | |- height |_________| _| (x,y) struct Rectangle { // Coordinates of bottom left corner int x, y; int height, width; }; bool RectanglesOverlap(const Rectangle &r1, const Rectangle &r2); 2. Implement the following C++ function to printf all the values of the binary tree nodes at the specified depth from the root. An iterative solution is preferred over a recursive one. struct TreeNode { int value; TreeNode *leftChild; TreeNode *rightChild; TreeNode *parent; }; void PrintTreeLevel(const TreeNode *root, int depth); ## Deliverables 1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Deliverables must be in ready-to-run condition, as follows (depending on the nature of the deliverables): a) For web sites or other server-side deliverables intended to only ever exist in one place in the Buyer's environment--Deliverables must be installed by the Seller in ready-to-run condition in the Buyer's environment. b) For all others including desktop software or software the buyer intends to distribute: A software installation package that will install the software in ready-to-run condition on the platform(s) specified in this bid request. 3) All deliverables will be considered "work made for hire" under U.S. Copyright law. Buyer will receive exclusive and complete copyrights to all work purchased. (No GPL, GNU, 3rd party components, etc. unless all copyright ramifications are explained AND AGREED TO by the buyer on the site per the coder's Seller Legal Agreement). ## Platform c++