How to Construct a Binary Search Tree

nice video

thank you .
so much "Understanding"

bzzzt

Very well explained. I really had hard time understanding BST before this video!

Great explanation !!

Thank u sir..

Hello to students from The Odin Project

why did 8 'split' the 9 node? every other number went down the tree to the last entry and then to the left or right of it but 8 went to 9, skipped 14 and went to the left of 9. Why is that?

Might be out of the scope of the video but what would happen if you search for 7. Would it return the 7 on the first node or the 7 on the last node or both?

Is this in order or pre order or post order. I am so confused by the 3. I can print out what happens but not draw those tree up from initial array. Anybody that can help me please do, I have a test on monday ;(

this is terrible and may as well be a linked list

Thanks

Superb sir..❤️

Thank you so much for helping me understand the concept !!

I always thought binary search trees had to be balanced and that was giving me a hard time. I know now that having an ugly tree is perfectly fine

Well explained

You’re directly going to heaven😌💫

#1 explanation about BST in U-tube. 100% 👍👍👍

Excellent explanations

Very helpful!

Thank you <3

Thanks man saved!

can we put 7 in left side of 7

Thank you very much

you are beautiful

I need graphics project code on this...

helal

Thanks !

why repeat 7??? what if you are asked to delete 7 from this binary tree you have formed

About 7 - your argument is that it goes right, because it's NOT LESS then 7, i can got with the same argument and say it can't got left because it's NOT GREATER then 7.
It should just remain the way it was, without adding extra 7 into the tree.

thanks man you saved the day

Thank you! :)

Can you draw BST's in a different order but it still follows the rule of a BST? like can there be 2 versions

This video saved me . It's really helpful.

Awsome sir i got full marks in my examination at this question.

thank u man

What if we want to search 7? is the last 7 after 8 will be searched or when it search the first 7 and the search end?

Thanks man, you saved me! :D

Thank you so much..this helped!

thx help alots

are duplicates allowed in a BST? (7)

ready sme

brano sup sem sup tam caka na komentare

predkozka ready ako nikdy predtym

moja obriezka je ready

what is the order of building BST from an array?or for example,building BST from 3 sorted arrays?

What is the software you are using?