Address store in the area

#1

I don’t understand how the address of the node is stored in the queue by simply pushing the data;
we are doing like this

queue <node*> q; // node * type

q.push(root->data)
so how we are referencing the address here we actually point the integer

#2

in the end of the vedio the lectures has corrected the mistake
as it should be q.push(root) instead of q.push(root->data)

#3

@O17LPOLA020023 got it thanks can I know if I able to able to finish the course in 6 months so I don’t have any TA support. so how to get it ?

#4

you can contact to mentors for that , i am not aware to these details

#5

@O17LPOLA020023 I have problem related to big 0

analysis
analysis950×309 19 KB

here I have to find out the upper bound so, i have to choice the greater one n^2logn + n ?

#6

upper bound for F(n) should be n^2logn+n
and lower bound should be n^2logn

#7

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.