25. Subordinates | CSES | Competitive Programming for solving Trees | Binary Tree Tutorials

#tree #datastructures #interview
Hello viewers!
In this video, we have discussed the Subordinates from CSES.
----------------------------------------------------
CSES Problem Link: cses.fi/proble...
--------------------------------------------
CPP Code: github.com/aak...
--------------------------------------------
Python Code: github.com/aak...
Please consider subscribing to the channel.
Extra video covers:
Tree Data Structures
Binary Tree Data Structures
Video Series on Tree
Best Tree Videos
Beginner to Advanced
Binary Tree Tutorials
Tree Tutorials
Tree for Competitive Programming

[@challengefitness-gz9bo]

welcome back sir

[@ananyapamde4514]

Underrated channel!!

[@ashutoshtiwari5138]

woww great

[@namratapatil8692]

👍👍

[@talibkhan-rf2dz]

Sir or videos kab aayegngi .

[@manishmalik.]

Bro upload next lecture of this tree series 🧐

[@AnshumanPandey339]

Bhaiya upload Playlist on Graph

[@Innoskrit]

Will start recording soon.

[@ksh0demonz]

@@Innoskrit Hi, I really liked your series, When we can expect series on Graphs ?

[@harshitjoshi6329]

from collections import defaultdict
import sys
sys.setrecursionlimit(10**6)
tree = defaultdict(list)
def solve(src, par):
subor = 0
for child in tree[src]:
if child != par:
solve(child, src)
subor += 1+ans[child]

ans[src] = subor
if __name__ == '__main__':
n = int(input())
ans = [0]*(n+1)
inp = [int(x) for x in input().split()]
for i in range(2,n+1):
tree[inp[i-2]].append(i)
tree[i].append(inp[i-2])

solve(1, 0)
for i in range(1,n+1):
print(ans[i]," ")
can any one explain why this code getting TLE in last case of 200000 input but other case of same imput length worked

[@yatharthbhatnagar756]

Same doubt

[@challengefitness-gz9bo]

so long