** * ## Balanced Binary Tree Visualization * * Task: * Create a balanced binary tree visualization using nested squares where: * - Root: One square * - Level 1: Two squares side by side * - Level 2: Two squares inside each Level 1 square * * Colors should be assigned in pre-order traversal: * (root -> left subtree -> right subtree) * * Input: * const VIBGYOR_colors_named = [ * 'Violet', * 'Indigo', * 'Blue', * 'Green', * 'Yellow', * 'Orange', * 'Red' * ]; * * Expected color assignment: * - Root: Violet * - Left subtree: Indigo (parent) -> Green, , Yellow (children) * - Right subtree: Blue (parent) -> Orange, Red (children) */ second dsa question was based on concentric square which was easy to solve and solved it.
