Basics of Data Structure

B-Tree

B-Tree in Data Structure. Every node in a binary search tree, such as an AVL Tree or a Red-Black Tree, can only have one …

Binary Search Tree

A Binary Search Tree (BST) is a tree in which all nodes have the properties listed below:  The left sub-tree of a node has …

Tree Traversal

Traversal is a method of traversing all of a tree's nodes and printing their values. We always begin at the root (head)…

BFS (Breadth First Search)

When a dead end occurs in any iteration, the Breadth First Search (BFS) method traverses a graph in a breadthward motion and…

Load More
That is All