Introduction to Binay Search Trees - Data Structures & Algorithms 2016

Binary Search Tree also called Binary Sorted Tree.

In this lesson, we have discussed binary search tree data structure. Binary search is an efficient data structure in which we can store data to get search, insertion and deletion, all in O(log n) running time. We have drawn comparison of Binary search tree with arrays and linked list and explained this concept in detail.

BINARY SEARCH TREE DEFINITION: A Tree is called a Binary Search Tree (BST) if each node N is such that value at N is greater than every value in the left sub tree and is less than or equal to every value in the right sub

tree.

Don't Forget to Subscribe Our Channel For more Software related videos.

https://www.youtube.com/channel/UCvtgPQq67sRfz3m2T_OrIWA

Our Facebook Page

https://www.facebook.com/Tuts-Online-1175068025891211/

Our Google+

https://plus.google.com/u/0/b/106482468968232599840/106482468968232599840/

Follows us on Our Twitter Account

https://twitter.com/mughal_zeeshi

Official Blog

https://tutsonline1.blogspot.com/