NeuralLantern.com -

BST Terminology: Root, Leaves, Subtrees, Depth, Height, Ancestors & More

This video explains essential binary search tree terminology including root node, internal nodes, external nodes (leaves), left and right subtrees, depth of a node, height of the tree and subtrees, ancestors, descendants, siblings, parent and child relationships using a clear example tree.

mike April 6, 2026

Binary Search Trees Computer Science Data Structures

Binary Search Tree Definition Explained Step by Step

A Binary Search Tree (BST) is a rooted binary tree where for every node, all values in its left subtree are less than the node's value, and all values in its right subtree are greater than the node's value. No duplicates in this simple version.

mike March 31, 2026

Assembly Language Coding Computer Science

YASM x86-64 Assembly Functions Tutorial – Integers, Floats, Pointers, ABI, C++ Interoperability

Learn how to write callable functions in YASM x86-64 assembly on Ubuntu. Covers passing integers, pointers, and floating-point values, using the correct registers (RDI, RSI, XMM0, etc.), returning values in RAX/XMM0, extern \"C\" for C++ interop, and building a hybrid C++/Assembly program.

mike March 22, 2026

Assembly 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.

mike March 16, 2026

Assembly 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.

mike March 7, 2026

Assembly 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.

mike March 1, 2026

Assembly Language Coding Computer Science

x86-64 Assembly Pointers & Dereferencing Explained – Hybrid C++/YASM Example

This video explains pointers and dereferencing in x86-64 YASM assembly and demonstrates passing pointers between assembly and C++ in a hybrid program. We show how to read a C string from assembly, modify a long via pointer dereference so the change is visible in C++, and send assembly-owned data (string, long, double) back to C++ using pointers.

mike February 22, 2026

Assembly Language Coding Computer Science

x86-64 Assembly: Floating Point Registers Basics with YASM (MOVSD, MULSD, CVTSI2SD)

Learn the basics of floating-point registers (XMM0–XMM15) in x86-64 assembly with YASM. Covers MOVSD, MULSD, CVTSI2SD, ABI rules, why floats return in XMM0 instead of RAX, saving/restoring around calls, and common stack alignment crashes when using printf.

mike February 15, 2026

Assembly Language Coding Computer Science

Implement strlen for Null-Terminated Strings in x86-64 Assembly (YASM)

Learn to implement strlen from scratch in x86-64 assembly using YASM. We walk through building a null-terminated string length function with a while loop, proper register preservation, and ABI compliance, then use the length to print the string efficiently via sys_write.

mike February 8, 2026

Assembly Language Coding Computer Science

x86-64 Assembly For Loops Explained – YASM Tutorial

This tutorial explains how to implement a C-style for loop in x86-64 assembly using YASM by converting it to while-loop logic with initialization, conditional jump (jl), increment (inc), and unconditional jump back to the loop top. Demonstrates register usage (r12/r13), loop structure, and printing numbers inside the body.

mike February 1, 2026