Search
2 articles for “Binary Tree”
-
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
-
Assessing the Robustness of Machine Learning Models for Wireless Intrusion Detection Under Adversarial Traffic Perturbations
Abstract: As the Internet of Things (IoT) devices and wireless communication networks continue to grow rapidly, protecting systems from cyber threats has become increasingly important. Machine learning–based intrusion detection systems (IDS) have shown strong potential in detecting abnormal and malicious network activities, yet their effectiveness and resilience when facing adversarial attacks are still not sufficiently explored. This research evaluates Machine Learning (ML) models–XGBoost, random forest, and multi-layer perceptron (MLP)—in detecting attacks …
Published in International Journal of Wireless Security and Networks · Vol. 4, Issue 1, 2026 · pp. 29–34 Read article