Explore core tree terminologies, including root, leaves, internal and external nodes, parent and child relations, siblings, degree, level, height, depth, and the subtree concept.

Learn how to implement a binary tree using a linked-node approach in C++ (and other languages), with left and right pointers, root and leaves, and dynamic memory allocation.

Define a self-referential node structure in C++ to implement a binary tree, with left and right pointers and a data field; allocate memory via dynamic allocation.

Create a simple binary tree in C++ by defining a node structure, allocating memory, and manually linking six nodes with left and right pointers, using an online compiler.

Learn preorder traversal of binary trees by visiting the root first, then the left subtree, then the right subtree, with multiple examples and practical rules.

Learn how to compute post order traversal of binary trees by visiting the left subtree, then the right subtree, then the root, with step-by-step examples and patterns.

Master inorder traversal of binary trees by visiting the left subtree, then the root, then the right subtree, using examples with preorder and postorder.

Explains how to implement post order traversal in C++ using a recursive approach, visiting left subtree, right subtree, then root, with base case null, and demonstrates with binary tree examples.

Demonstrates a concrete in-order traversal implementation in C++, visiting the left subtree, printing the root between left and right, then traversing the right subtree.

This lecture presents a recursive algorithm to compute a binary tree’s height by taking the maximum of left and right subtree heights and adding one, with a null base case.

Implement a recursive algorithm to sum all nodes in a binary tree by adding the root data to the sums of left and right subtrees, with zero as base case.

Trace a recursive function to sum all tree nodes by adding the root data to the sums of its left and right subtrees, returning zero for null nodes.

Convert the binary tree maximum-finding algorithm to find the minimum by swapping comparisons and updating initialization with a high value near infinity to ensure correct minimum logic.

Explore level order traversal without a queue using a brute-force method: compute the tree height, iterate levels, and print nodes at each level with a recursive printLevel function.

Learn how to derive level order traversal with a queue to traverse a tree level by level, using push, pop, and a level-separating null marker.

Learn to implement level order traversal using a queue to process tree nodes, pushing root and its left and right children, and using a level-end marker to print each level.

Learn to perform vertical order traversal of a binary tree using a hash map to group node values by vertical columns, then print each column.

Trace vertical order traversal of a binary tree by mapping nodes to indices, starting at root index zero and visiting left and right subtrees while storing values in a map.

Define a node struct with left and right pointers, use malloc for dynamic memory in C, create a new node, and count tree nodes recursively with a null base case.

Learn to determine whether two binary trees are identical by comparing corresponding nodes recursively, ensuring roots, left subtrees, and right subtrees match.

Implement a recursive is-identical function to determine if two binary trees are identical by comparing root data and recursively checking left and right subtrees. Return 1 if identical, 0 otherwise.

Mirror a binary tree by swapping every left and right node while keeping the root unchanged, using a temporary variable for each swap, and verify with inorder traversal.

Mirror a binary tree in place by swapping left and right children, using in-order traversal to show before and after states with a recursive, root-null base-case.