Binary Search Tree (BST) with Example | Time Complexity in Urdu/hindi

In thsi lecture binary search tree (BST) has been explained with help of example in detail.

Keep in mind that there is a difference between “Binary Tree (BT)” and “Binary Search Tree (BST)” Common Things in BST and BT are.Tree always start from the root. Each elements in the binary tree can have at most (maximum) 2 elements. Difference in BST and BT are.BT is unordered while BST is ordered.Searching, deleting and insertion operation of BT is slower than BST


#AzComputing
#BinarySearchTree

#BSTComplexity