C++ || EASY
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    int numberOfChild(int n, int k) {\n     int pos = 0,dir = 1; \n        for (int i = 0; i < k; ++i) {\n            pos+= dir;\n            if (pos == 0 or pos == n - 1) {\n                dir *= -1;\n            }\n        }\n\n        return pos;    \n    }\n};\n```
['C++']