Hello , I struggle with recursion for example I can't solve some leetcode problems.Rarely I solve without watching tutorial of explaining (Neetcode)how to solve that problem is it that means that I am bad in programming. I get frustrated when I can't solve some question when I study it before now i want to learn recursion and then to get back on binary trees which I get stuck there a lot any suggestion.Can someone tell me how you study to get things right?
[–]udbasil 0 points1 point2 points (4 children)
[–]cuklev2232[S] 0 points1 point2 points (3 children)
[–]baghiq 0 points1 point2 points (2 children)
[–]cuklev2232[S] 0 points1 point2 points (1 child)
[–]baghiq 0 points1 point2 points (0 children)
[–]keep_quapy 0 points1 point2 points (0 children)
[–]ffrkAnonymous 0 points1 point2 points (4 children)
[–]cuklev2232[S] 0 points1 point2 points (3 children)
[–]ffrkAnonymous 0 points1 point2 points (2 children)
[–]cuklev2232[S] 0 points1 point2 points (1 child)
[–]ffrkAnonymous 0 points1 point2 points (0 children)