International Journal of Data Structure Studies
Volume 4, Issue 2 (2026)
Table of contents
-
Traversal Speed Comparison of BFS and DFS in Balanced and Skewed Binary Trees
Abstract: In this paper, we provide an analysis of how well both breadth-first search (BFS) and depth-first search (DFS) algorithms perform while wandering through two kinds of binary trees: balanced and skewed. The research was motivated by the practical application of storing files and directories in a certain type of parent-child relationship through the use of hierarchical file systems (e.g., windows explorer). The result of measuring how fast and versatilely these …
Published in International Journal of Data Structure Studies · Vol. 4, Issue 2, 2026 Read article
-
Interactive Visualization and Analysis of Sorting
Abstract: This paper describes a complete review of pedagogical barriers to teaching algorithms, including development of an interactive visualization and analysis tool in Java to represent three commonly used sorting algorithms: Quick Sort, Merge Sort, and Heap Sort. Sorting algorithms are a critical part of many types of data processing, but for some students they can be challenging to visualize or conceptualize as a series of steps because traditional methods of …
Published in International Journal of Data Structure Studies · Vol. 4, Issue 2, 2026 Read article
-
A Comprehensive Review of Durable State Persistence Techniques for Resilient API Calls in Kubernetes-Based Microservices
Abstract: Kubernetes lets teams scale microservices and replace pods almost without notice. The same design that makes clusters reliable creates an intractable problem for API calls that require multiple steps on multiple individual services. A pod can stop suddenly. Any progress retained only in the memory vanishes. The client is forced to start the whole thing over. Data that is left behind can end up inconsistent. Durable state persistence is a …
Published in International Journal of Data Structure Studies · Vol. 4, Issue 2, 2026 Read article