Binary Search Trees
Definition A binary search tree is a binary tree whose keys satisfy the binary search tree property: Let x be a node in the BST. If y is a node in the left subtree of x, then key[y] <= key[x]. If y...
View ArticleDepth First Search
Description The goal of Depth First Search is to search as ‘deep’ into the graph as possible, which is opposed to Breadth First Search which is to search as ‘wide’ as possible. In DFS, edges are...
View Article
More Pages to Explore .....
