Question: Consider a tree structure where each node is of type QuadTreeNode, which holds a pointer to 4 child nodes. class QuadTreeNode {public: int value; QuadTreeNode*

Consider a tree structure where each node is of type QuadTreeNode, which holds a pointer to 4 child nodes. class QuadTreeNode {public: int value; QuadTreeNode* child [4];}; (a) How many nodes would be in a full tree of QuadTreeNodes with a depth of 1? What about a depth of 2? (b) Provide a general formula for the number of nodes at depth i for a full tree made of QuadTreeNodes. (c) Provide a general formula for the total number of nodes in a full tree made of QuadTreeNodes with max depth
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
