L39. Introduction to Binary Search Tree | BST

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


Find DSA, LLD, OOPs, Core Subjects, 1000+ Premium Questions company wise, Aptitude, SQL, AI doubt support and many other features that will help you to stay focussed inside one platform under one affordable subscription. Have a hassle free one stop solution for up-skilling and preparing.

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

Hi, hope you are well.


Find DSA, LLD, OOPs, Core Subjects, 1000+ Premium Questions company wise, Aptitude, SQL and many other time saving features under one affordable subscription. Have a hassle free one stop solution for up-skilling and preparing yourself.


takeUforward
Автор

At first i used to think there's a lot of competition in the world,
but then i saw the amt of likes getting decreased with every video, that's where i got the intution that the actual competition is just of only few thousands..
Anyways loved your work throught the entire playlist 🥳🥳

abhishekbandil
Автор

Striver bhai content bhut sahi h appka, Had enrolled in Coding Ninjas course but here for revisions Spending thousands in courses but still here u can think how great your FAM admires you, Nothing more keep building more such series. CHAMP!

NavdeepSingh-qnis
Автор

Timestamps
00:04 - Introduction to Binary Search Trees and their prerequisites.
01:10 - Understanding binary search trees requires knowledge of tree traversal techniques.
02:27 - Binary Search Trees require structured node arrangement based on value comparison.
03:32 - Binary Search Tree must maintain ordered structure through its nodes.
04:41 - Modifying BST conditions to handle duplicate values.
05:44 - Binary search trees maintain efficient structure and search time complexity.
06:52 - Binary Search Trees maintain a height of log base 2 n for efficient searching.
07:57 - Binary Search Tree organizes elements by left and right placement.

MuthukumaranK-ep
Автор

It is so useful to know the subject in detailed, keep posting things.

sathwikadommati
Автор

Please likeeee, shareeee and :) Also follow me at Insta: Striver_79

takeUforward
Автор

I am having great learning with your channel. Thanks for the efforts !!

ForTech-rtqi
Автор

Thank you so much for such a great learning from your

mohit
Автор

Today is 21.07.23 and I am starting the BST playlist. The aim is to complete this series by 23.07.23

sauravchandra
Автор

3:29 - Why can't I have 9 in place of 13? It satisfies all the conditions.

harshthkkr
Автор

Thank you so much striver your are my friend for life

tav
Автор

He took this tree example from wikipedia:

parthsalat
Автор

why we can not have 9 in place of 13 ??

shubhamkumarrai
Автор

Thanks Alot ! || Understood || Easy Explanation

easycode
welcome to shbcf.ru