Binary Search Tree Visually Explained

[@venzdrop]

i worked on binary search tree today I did insert, bfs and dfs but now I just saw your search one and its helpful and the delete one. thanks for this video omg.

[@abskrnjn]

Wow too detailed and long video, will watch just before exams..

[@venzdrop]

i like the second searching code. great.

[@陈哲轩-t2m]

Well done. Sorted through my thought modules.

[@Byte_Quest]

Thnks

[@JetLagRecords]

ByteQuest, nice video keep it up bro

[@Byte_Quest]

Thanks

[@venzdrop]

on the else: return? on def insert. wdym by return? it returns nothing?

[@Byte_Quest]

Return means just return None.

[@venzdrop]

so when deleting root with two child, "we look for the biggest on the left or we look for smallest on the right? " or "we look at smallest from the left or biggest from the right? "

[@Byte_Quest]

Smallest in the right subtree.

[@venzdrop]

@@Byte_Quest got it. and biggest in the left subtree. thanks

[@venzdrop]

so what is the worst case for insertion and why?

[@Byte_Quest]

It's O(height) Best case when the tree is balanced in which case it would be O(log(n)) Worst case when the tree is unbalanced meaning the complexity will degrade to O(n), because the height is proportional to n in when unbalanced.

[@Byte_Quest]

Next video would be on "AVL tree" where balancing will be discussed in greater detail.

[@venzdrop]

w