How to Search in a Binary Search Tree (BST) – Step by Step Explanation with Examples
Posted inBinary Search Trees Computer Science Data Structures

How to Search in a Binary Search Tree (BST) – Step by Step Explanation with Examples

Learn how to search in a Binary Search Tree. We demonstrate searching for existing and non-existing values, explain why BST search is O(log n) on average, and show how poor data ordering can turn your tree into a slow linear structure similar to a linked list. Includes discussion of tree height and balanced vs unbalanced BSTs.
Binary Search Tree Insertion Tutorial: Building a BST from Scratch Step by Step
Posted inBinary Search Trees Computer Science Data Structures

Binary Search Tree Insertion Tutorial: Building a BST from Scratch Step by Step

Learn how to build a binary search tree (BST) by inserting numbers one by one. Follow the insertion process for the sequence 88, 21, 3, 6, 72, 34, 11, 1, 90, 65, 55, 17, 23, 9. See left/right decisions, pointer updates, inorder verification for sorted order, tree height calculation (6), and discussion of O(h) time complexity versus log n for balanced trees. Clear explanations without skipping steps.
Building a Binary Search Tree – Insertion Tutorial
Posted inBinary Search Trees Computer Science Data Structures

Building a Binary Search Tree – Insertion Tutorial

In this tutorial we build a binary search tree together by inserting the numbers 73, 98, 12, 45, 67, 10, 43, 11, 99, and 32 one by one. Starting from an empty tree, each number is placed according to binary search tree rules: smaller values go left, larger values go right. We let the nodes fall where they belong without any rearranging, resulting in a realistic (and slightly lopsided) BST. The video explains tree depth, height, and confirms the final structure maintains all BST properties with a properly sorted in-order traversal.
x86-64 Assembly: Local Variables, Stack Frames & Alignment Explained
Posted inAssembly Language Coding Computer Science

x86-64 Assembly: Local Variables, Stack Frames & Alignment Explained

Learn how local variables are allocated on the stack in x86-64 assembly using YASM. See exactly how to reserve space, address variables with offsets, understand downward stack growth, and fix mysterious printf segfaults caused by 16-byte stack misalignment. Includes two alignment solutions and a complete working example with a local integer array.
The Call Stack Explained: Call Frames, Return Addresses, Local Variables
Posted inAssembly Language Coding Computer Science

The Call Stack Explained: Call Frames, Return Addresses, Local Variables

The call stack is a special stack data structure that your computer uses to manage function calls. Every time a function is called, a call frame is pushed onto the stack containing the return address, function arguments (beyond what fits in registers), preserved registers, and space for local variables. When the function returns, its call frame is popped and execution jumps back to the return address - this is how your program knows exactly where to continue after a function finishes.
Mixed Function Arguments in x86-64 Assembly – Integers & Floats Explained
Posted inAssembly Language Coding Computer Science

Mixed Function Arguments in x86-64 Assembly – Integers & Floats Explained

In the System V x86-64 ABI, integer and floating-point arguments use separate register assignment sequences. Integer arguments go into rdi, rsi, rdx, rcx, r8, r9 (then stack), while floating-point arguments use xmm0 through xmm7 independently. This means the first integer you see — even if it appears after several doubles — always goes into rdi, and the second float always goes into xmm1 regardless of how many integers came before it.