Data structures: Binary Tree

Im toolazy to learn this sht

great

Can a binary tree also be classified as a generic tree?

Wonderful content, thank you very much.

Incredibly helpful, thank you.

Wouldn't be the diff be, diff = height of left sub tree - right subtree, so -> (2 - 0) = 2. Because left subtree have a max depth or height of 2 and right side we don't have a subtree so it will be 0. So the diff will be = | (2-0) | = 2 not | 1 - (-1) |. Can someone clarify?

For the ones who are confused between depth and height
Depth of a Node "n" in BT: Count the number of edges above the particular node upto the root node.
Height of a Node "n" in BT: Count the maximum number of edges present below that particular node 'n' is the height of that particular node.

Keywords: if it's height count edges BELOW and If it's depth count edges ABOVE that particular node.

oh my god this was so helpful. i've read so much content about trees and watched so many videos that always left me even more confused. But THIS ... this was just perfect and extremely well explained. thank you so much for making this video.

This was a mind-blowingly good video! Glad I decided to redo my math as I started watching the first videos of this playlist. Knew it would come in handy. I'm very thankful these videos were made, and wish their creator was still alive to see how many people they help.

Excellent. Master !

hello , can anyone know the name of the program used in the video for writing and sketching .

Thanks, a lot.

Awesome

seems i need to learn algebra to understand those Log :(.. lost after 7.22

Guys there also exists a different version
ACBT = Complete Binary Tree of mycodeschool
Complete BT = Perfect Binary Tree of mycodeschool

While Full/Strict/Proper and Perfect BT all are same.

which application you is using to teach sir

So i did the calculations and found that an average computer with a CPU frequency of 3GHz(which can execute 3 billion instructions per second) will take upto 13398978947110 years to execute 2^100 instructions. Crazy alright.

Couldnt understand much.. Seemed to be read out from a page.Helpful for quick revision, but not for understanding.

How would you reccomend me to learn this? because I'm having a hard time processing it, thanks in advance.

2 to the power ETCH

2power0 + 2 power1 + 2power2 ........ 2powerh generic would be 2powerh,
how come its 2(power h+1) -1 ?

H̸̢̝̖͖͕̘͕͕̙̝͒̓̑̈̇̄̊̎͛̑́̒̑͘͠ͅͅȨ̸̡̡̨̛͙̮͇̭͓͇͉̬̣̲̊͐́͗̿̋̆̆̚Ÿ̵̧̝́̋̀̓͌͘ ̶̹̬͚̺͚͉̀̇͗̽Ǧ̶̖̥̝̫̔Ṷ̴̪̺͚̱̫̦̘͎̦͗̇ͅÝ̵̡̰̖̣͉̥̹́̚S̴̛̖̼̖͔̲͈͇͊͜ ̷̡͖̄͂̋̉̀̀͒̾͜͠͝I̷̩̅̀M̴̨̨̢̛̺̙̞͔̠̠̼͆̈͐͗̏͗̐͑ͅͅ ̷̯̠̼͛̃̍̓̕G̶̻̫̳̹͌̎́̑̋͗̔̆͆̄̉̕͝Ǒ̵̓͘̕͜͝İ̷̝̺̗́̓̎̈́̈́̇̉̈́̊̇̃N̶̡̖̠͇̭̱͕̲̱͉͓͗̈́̈̕͜͜ͅͅG̴̛̯̮̘̽̾͂̋͂̕ ̸̧̩͉͙̗̘̲͔͐̆͊̈̐̄́̚T̷̘̻̺̭̯̹̟̹̟͑O̷̝̺͍͇̓́͑͊̔͗̎̓̂̉͂ ̷̨̢̻̗̯̖̺͇̻͙͊͑̕Ş̴͖̥͍̆̓͋̃͗̓̾̈͗̈́͆̇͂̐͒H̸̡̛̘̦̬͖̳̙̽̈́͑͊̃̿̓͜Ǫ̴̡̳̯͙̖͓̘̮̜̺̮͔̰͊̅̀̔̽͗͋͋̒̓̈͆̒͊̚Ẇ̸̹͋͗̌̓̅̊͂͑̂̍̐͝ ̶̧̨͍͓͙̗̜͙̻͓͓̌̂̅̃͐̚Ȳ̵̨̹̫͍̬̦̥̣͓͕̟͘͜ͅȌ̷͕͍̭̓̉̿̎̏͑̚͝Ư̴͓͚̋̑́̀̂͐̕͠ ̶̡̳̻̠̭̙̳̳̮̪̖̽͜Ḫ̵̛̇͂͌̍O̷̡̰͈͉̳͉̓̎̿͗̀̈̏̈́͑̊̓͒͠W̶̦̲̯̫̯̤̙̯̽̃́̑̈́͌̅͘ ̸̡̛̛̞̰̻̝͗̎͆̃̎͗̽̈́̏̆̕͝T̷̨̙͉̳̼͎͉̞̝͇̬̙̩̯͐͛̈́͛͌̓̉̔̓̎̕͠Ǫ̷͈͕̭̦̭͙̮̰̩̬̜̐̐̋̄̄̈́̄̈́̄̊ ̶̡̦̟̯̙̺̬̪͚̭͓̿Ĩ̷̙͒̀̉̀͌͊͠͠N̸͙͇͙̟̦̓̔̉̇̔̇̔̎̋͗̏͝͝͝V̷̧͖̼̮̼̗̺̺̥̲̥̹̫̑̉͐͐̓̓̍̚E̵̡͈̩̹̠̔R̸̲̜̻̬̮̯͇͕͈͎̬̝̠̂̒̀͜Ţ̸̛̖̱̪̦̰͓͗̈́͋̔̄͌̓ͅ ̸̯̓͂͊͌̀̃̃̆̚͘͝͠͝A̵̝͉͔̝͕̝̠̫͖͓͒́͜ ̷̧̥̼̣̙̩̘͈̽͊͑͘͘B̵̛͓͚̘̻͌̍̔͆̔̈͆̃͑̍̕͘I̷̢̧̢̧͓̮͇̘̬͔͓̳͚͛̔̂̚̕ͅA̵̻̭̳̘̭̝͗͒̿̏̃̀͂̀̆̍̌̕̕͝ͅN̷̨̫̣͉͇̙̽́̍ͅA̸̝̪̙͉͍̠̯̱̭̬̪͋̈̈́͗͑̇͝ͅŔ̷̢̞̮̝̝̬́̽́͌̔̀̎̎͌Y̶̮̩̯̫̙͔͕̦̬̦̱̫̯͔͂́̓̇̋͐͐͑͘͘ ̴̫͈̞̯̄͝T̴̨̙̫͎̖̟̘͎̘͔̝̖̻̱̊̑̽̋̐͂͗̓̾͘͜͝͝Ŕ̶̢̨͙͕͍̝̺̫͉̻̉͗̾̓͛̋̄ͅE̴̛̘̥̪͎̱͇͑͋̐̇̌̑E̷͉͕̭̤̦̮̣̭͍͍̟̓̈́̐̾̎̃

Hi. I am one of your subscriber, been following you for a couple of months. Can i possibly use this as a reference in our class, seems like you do have a very clear way of explaining. Thankyouuu.

MyCodeSchool is true

very interesting tutorial

Nice one bro

you are best brother

Don't get diff=|hleft-hright| .

This is an awesome series - even 7 years later!

nice

how the balanced binary tree is calculated

amazing vid ty
i < > you

Implementation of binary trees using Arrays is only possible for Perfect Binary Trees, right? Not Complete Binary Trees?

Great lesson. The log stuff threw me off, but I just need to review all that anyway

simply best

if you sir dont go to heaven i will cause a fuss in the judgment day

This is a masterpiece, thank you so much for the job that you're doing!

tree can be implemented using arrays if tree is perfect binary tree not just complete .
and your are one of the best in cs topics on the entire internet ,keep uppp

I was with you until half way through the video lol

Me to my Brain during the class - " Please DON'T "

BRAIN - " OOOOOO SWEET CHILD O' MINEEEEEEE "

is there a way to implement binary tree without using queue(like BST)?