BINARY TREE REPRESENTATION - DATA STRUCTURES

[@ManishSharma-jz2hw]

I was lucky enough to find your tutorials. You really explained this in simplest way. Thank you for your effort.

[@RJSR_1234]

Me too bro

[@chemxo8723]

Thank god There are teachers who delivers free education

[@fullstackcourse]

YOUR TEACHING IS WONDERFUL, AMAZING AND JUST WOWWWW!!!

[@anushreejoshi1829]

Thankyou so much sir...your all video's are amazing...💯easy to learn...

[@kuttyreddy1603]

Understand alot..tq so much sr 💕💕💕

[@rakesht7034]

Sir the way of your explain is too good thank you so much sir

[@devanshusharma3733]

Hi Sir, I love your lectures. Thanks for making those videos. I have one suggestion like please can you give some sequence number those videos. So any can get to know from where need to start. Thanks

[@patrickmathenge7996]

You are a good teacher. understood. God bless

[@msaikiran9237]

Simply Amazing 👍

[@vinitha5369]

Thank you sir for explaining with clarity

[@samadsaifi3759]

Very Helpful 👍👍

[@ytstyles4281]

really appreciate ur hard work sir,,,this is very helpful for us thanks a lott

[@letsgoswe]

I really cant thank you enough sir! It's the easiest explanation I have seen in entire YT! 070922

[@mohammedhamza5799]

Superb

[@prabhavathi01]

Teaching is Awesome Show the code along with this concept . Its very useful.

[@sonuswami4552]

You explained in easy way...thanks sir.

[@bogeswarroyal2684]

👌 👌 👌 👌 simply understand

[@nageswararaovalluru7409]

Sir u teach very nice

[@snehamurali6797]

Thanks you sir .....It helps me a lot❤

[@karthikappilisetti340]

Thank you sooo much sir

[@madymadhan1946]

Thank you sir.. easy to understand

[@anuchouhan2100]

Tq so much sir

[@sahithireddy]

Thank u ☺️ so much sir

[@poojithanaramala]

Tq u sir

[@priyankagurrapagari2616]

👌👌👌

[@naveenkumar-rz1ge]

In arrays if there is a clash between 2 nodes then what we should place first

[@nishtha0901]

Thank you

[@nithish0383]

Hii

[@gyanersondhane5511]

sir I watched a video where considering root index 1th position,calculate left child 2*i and right child 2*i+1. My question is what shoud be the position of a root node 0th or 1st?

[@saivenky5928]

Sir y should u takeing only 5 empty slots in 1st xample for using arrays

[@shaikrahaman6776]

Sir 10 m ki istey EEE ans rastey saripotundha sir

[@bhimavaramuma4631]

thank u sir

[@sumaschoosy9687]

Sir.... Can you please upload a vedio on binary tree construction code.... Please sir

[@archanareddy2373]

Tqu sir

[@Decent_editor85]

Sir how i=4 in G??

[@kusuma9625]

Tq

[@suradakodandarao962]

Sir you wrote wrong in right child last one .....it will be 2i+2=2*4+2=10

[@saikiranmaragouni1364]

No it is left class

[@novicecoder5753]

Sir please tell how to find the address?

[@damodarareddypadiri3529]

2 dimensional array representation of binary tree

[@koushikreddy7304]

sir, please explain the code of binary search tree

[@fardilviews]

thanks

[@prateekjain6711]

at the time of initializing an array how much size should we take for implementing a binary tree

[@Hari_Bhakth]

No of nodes = size of the array

[@gyanersondhane5511]

maximum array shoud be of size 2^n - 1 where n is number of level

[@creationofinfinitysasa6648]

[@shivgauripatil3512]

Sir why u take up to no. 18

[@siddhantchilke1159]

Sir you teach so nice but ur videos are long . Can it not be shorter. Maybe writing on bord is more time consuming.