Trees

Diameter of Binary Tree

Pre, Post, In Order in One Traversal

Learn how to solve the problem of pre-order, post-order, and in-order in one traversal. This article post includes, problem understanding with examples, different approaches to solve it with intuition, approach, code explanation and complexity analysis.

Frog Jump Problem

Understanding Binary Search Tree

Level Order Traversal

Perform level order traversal of a binary tree using a queue in C++. Visit nodes level by level from left to right with clear code, explanation, and time-space complexity analysis.

Understanding Trees DataStructure

Learn tree data structures in-depth: definitions, types, examples, real-world uses, C++ code, and key concepts like height, depth, leaf, subtree, and binary tree types.

Tries

Binary Search Trees

Find the Single Number in an Array Where All Others Appear Twice

Find the single non-repeating element in an array where every other element appears twice. Solve it using hashmap or optimal XOR-based bit manipulation in C++ with O(n) time.

Balanced Binary Tree

Convert Sorted Array to Binary Search Tree