TREES - Data Structures | Important MCQs (Detailed Solutions) For All Computer Science Exams | DSA

[@snehabansode2950]

This video is very nice sir I got each n every thing very easily...thank u so much sir 👌

[@KSDFIRE]

Super sir... we expect more like this u r a good teacher

[@jayap8355]

In Ques no. 3 I think you told the definition of full and complete Binary tree opposite

[@jayap8355]

None of the option is correct in Ques 3

[@ranjiniramachandran629]

@@jayap8355 i agree with you

[@namitarora3636]

@@ranjiniramachandran629 yes q3 is incorrect.

[@sarmad6166]

3:24 You have mistakenly consider the definition of full binary node and interchange it with complete binary tree

[@-PrachiJadhav-ck6ih]

question 2 answer is B [DEPTH] because from root node to leaf node it is DEPTH of the node

[@Hello-sx6kv]

Totally agreed 👍

[@krishnavaishnavkhandar]

No madam....... Going to root is depth
Going to leaf node is height.

[@shalinij1920]

Super session.Nice collection of good psu questions

[@alka-uo1qb]

Superb sur

[@learnngrow7802]

Thnku

[@mansvirana23]

Thankuu so much sir 😊

[@gauransharora9877]

QUESTION 2-->The number of edges from the root to the end leaf is called depth of the tree.

[@Ajayramisetti2003]

Ya its depth

[@gangayadhavan]

Exactly 💯 depths

[@vijisekar4540]

Semma

[@OG_freefire]

best explanation in world

[@ArihantOnlineAcademy]

Glad you think so!

[@Sachinkumar-xz6xm]

03 - no option is correct

[@karthik49205]

Yes

[@skullshot833]

The total number of different treess that are possible 6 nodes is......plz explain this question

[@kirupaathi]

Tq bro 🤝
Super Good job 🙏

[@ankitathakur5989]

Thanks sir ji

[@suganyak8509]

Thank you sir

[@rinilkr3684]

Nice

[@swathikadiyala99]

Sir pzz give McQ's on types of grammar in theory of computations in detail and give McQ's on cs pgecet the exam is conducted on 28th to 30th of September

[@ArihantOnlineAcademy]

Surely, Stay tuned.

[@vaishnavidongare4408]

Thanks

[@arihanthirawat6574]

thank you

[@Priya-jb7uz]

Nice session sir....👌but I have one doubt sir regarding question no 5.....that is ,level order traversal also visit root node first sir.....but I don't know whether it is right or wrong....

[@krishnavaishnavkhandar]

All question are right sir

[@pkgamer2383]

please make some more MCQ of ds,cn,os

[@rajni5306]

Nice session sir.....

[@ArihantOnlineAcademy]

Thanks and welcome

[@aradhaman1011]

Q.no2 depth i think

[@ab.dariefkhan1737]

Great work bro...👍

[@ArihantOnlineAcademy]

Thank you so much 😀

[@banadipmudi3186]

Bro the last question should be perfect binary tree instead of complete binary tree bcz in complete binary tree any internal node contain 0 no. of node also

[@vijaykumar-sl7rp]

bro I'm a mechanical final year student...I want to attempt GATE CS paper on 2022 .So... do you provide any service for that?

[@ArihantOnlineAcademy]

We are uploading gate lectures for free you can watch and ask your doubts.

[@venip9106]

🙏🙏🙏🙏🙏🙏🤗🤗

[@ravi27633]

Questions 3 ka "B " ans hoga bhai

[@bitbybit1449]

Sir in question no 3 the definition of complete binary tree and full binary tree explained wrong....complete binary tree have more restricrion than full so option jo 2 is right every complete binary tree is full binary tree..

[@ArihantOnlineAcademy]

Yes, That's True!

[@yashdaga2763]

I think, In 9:39, both the child nodes of root has degree 3, kindly check and revert!

[@iamranjeetpurohit]

I think you are wrong bcoz the degree is numner of child nodes, in your case the child nodes of the root node's child node is 2 hence degree is 2.
If there is any leaf node then degree is 0.

[@divyasharma-ye7zl]

How should I get playlist of your mcq

[@ArihantOnlineAcademy]

Please visit playlist section of our channel and get all list from there, for more assistance feel free to ask! :)

[@didyuknow6118]

Is this maths questions ?

[@todoenuno2053]

sir i have a doubt in question 2 it can be depth i am not sure

[@ArihantOnlineAcademy]

The depth of a node is the number of edges from the root to the node. The height of a node is the number of edges from the node to the deepest leaf.

[@gangayadhavan]

​@@ArihantOnlineAcademy height..... bottom to top. Sir... only count the node
Depths.....Top to leaf node....no of edges....

[@kumarsandran3814]

Teach fast
Say slow sir

[@karthik49205]

I think all options are incorrect in 3Q

[@ArihantOnlineAcademy]

Thank you for feedback, we will review it.

[@amitgupta-il8ts]

Thanks sir

[@pannagabm2100]

Thank you

[@bipashamondal4603]

Thanks