tabanshaukat/DFS-and-BFS-Romania-Problem

Stars
4
Rank 3,304,323 (Top 66 %)
Language
Java
Created almost 6 years ago
Updated almost 6 years ago

tabanshaukat/DFS-and-BFS-Romania-Problem

tabanshaukat

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

Depth First Search(DFS) and Breadth First Search(BFS) is used to reach Bucharest from Arad on the Romanian map.

2-3-Trees-data-structure

A 2-3 tree is a type of a tree data structure whose one node can have maximum 2 keys and minimum 1 key. The operation of insertion only occurs at leaf nodes. The node having one key are called 2 node and node having two keys are called 3 nodes. B tree of maximum degree 3 also makes a 2 3 tree. The path from any 2 or 3 node in its sub tree to leaf node must be same.

MLH-Web-Development-Worshop