Search Articles — Sudonull

https://sudonull.com/binary-search-trees-o-log-n-and-cache-performance

Breakdown of real binary search tree (BST) performance in the cache memory context. Why O(log n) is not always fast, comparison with sorted arrays and when to use BST.

https://sudonull.com/binary-planets-criteria-search-and-discoveries-in-astronomy

Explore the criteria for binary planets, modeling of rocky pairs and discoveries of JUMBO gas giants. Read the analysis of modern astronomical data.

https://sudonull.com/ternary-counters-mod-3-circuits-on-binary-elements

Analysis of semi-modular frequency dividers by 3: from triggers to distributors. Logical equations, perfect implementations, comparison of approaches. For middle/senior developers.

https://sudonull.com/goclaw-on-go-ai-gateway-in-35-mb-binary

Breakdown of GoClaw — multi-agent AI gateway on Go instead of Node.js. One 35 MB binary, low RAM, goroutines for agents. Deployment and architecture comparison. Deploy on VPS without dependencies — read the details.

https://sudonull.com/search-algorithms-o-log-n-vs-o-n-in-python

Breakdown of linear, binary, exponential search and hash tables. Code, complexity, selection checklist. For middle/senior developers. Benchmarks and LeetCode examples.

Dec 15, 2025 ·

https://www.geeksforgeeks.org/dsa/binary-tree-data-structure/

Dec 15, 2025 · A Binary Tree Data Structure is a hierarchical data structure in which each node has at most two children, referred to as the left child and the right child. Introduction

Oct 9, 2025 ·

https://www.geeksforgeeks.org/dsa/introduction-to-binary-tree/

Oct 9, 2025 · Binary Tree is a non-linear and hierarchical data structure where each node has at most two children referred to as the left child and the right child. The topmost node in a binary tree is called the root, and the bottom-most nodes (having no children) are called leaves.

Feb 2, 2026 ·

https://intellipaat.com/blog/binary-tree-in-data-structure/

Feb 2, 2026 · When you define a binary tree in data structure, it can be described as a tree-like model that organizes data with a root node at the top and branches spreading downward . In this structure, the top-most node is called the root node, and nodes that do not have any children are known as leaf nodes.

Mar 18, 2024 ·

https://www.baeldung.com/cs/binary-tree-intro

Mar 18, 2024 · In this section, we’re going to discuss six types of binary trees and describe each with an illustration. 4.1. Full Binary Tree . A binary tree is said to be a full binary tree when each internal node has zero or two children: 4.2. Perfect Binary Tree .