MIPS Assembly implementation of BFS & DFS algorithms for binary trees. The project returns the level of a searched element and includes utilities to convert between two array-based tree representations.
tree mips assembly data-structures mips-assembly dfs assembly-language binary-tree bfs breadth-first-search depth-first-search tree-traversal dfs-algorithm array-manipulations bfs-algorithm tree-algorithms mars-simulator
-
Updated
Jun 24, 2025 - Assembly