Pre-order traversal in Binary Search Tree 🌴

preview_player
Показать описание

Рекомендации по теме
Комментарии
Автор

Thank you. I don't speak ur language but I understand the video and it really helps me with my homework

creatordaylight
Автор

It is wrong
In preorder traversing root node is present at the beginning followed by left and right subtree node
And the correct pre order traversing is 10 12 14 15 18 20 25

sthitiprangyabehera
Автор

Brother 12 ka bad 10 nhi aya ga.. please ya to explain kr dain matlab root sa phala left wala nhi dhaka ga

alicreationphotography
Автор

It is wrong bro, it will come under data base management system

harshamallur