<<< Binary Search Tree

1. Properties of Binary Search Tree: e.g. 

1. All the node values of the left subtree are smaller than the node value of the root

2. All the node values of the right subtree are greater than the node value of the root

3. BSTS aren't completed binary tree

4. BST'll be the completed binary tree when BST is stored in memory as Linked List

2. Basics of Graph: e.g. 

1. Undirected Graph

2. Directed Graph

3. Weighted Graph

4. Path

5. Connected Graph

6. Cycle

#Programming #Algorithm #CodeAnalysis #BinarySearchTree #AbdurRahimRatulAliKhan

>>>