IndeluxifybyKunal Sinha·Dec 21, 2025Leetcode 1161. Maximum Level Sum of a Binary TreeGiven the root of a binary tree, the level of its root is 1, the level of its children is 2, and so on.
IndeluxifybyKunal Sinha·Sep 5, 2025Leetcode# 199: Binary Tree Right Side ViewGiven the root of a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from…
IndeluxifybyKunal Sinha·Sep 4, 2025Binary Tree Sum of each levelGiven the root of a binary tree, return the sum of the nodes at each level. The output should be a list containing the sum of the nodes at…
IndeluxifybyKunal Sinha·Aug 23, 2025Leetcode #314: Binary Tree Vertical Order TraversalGiven the root of a binary tree, return the vertical order traversal of its nodes' values. (i.e., from top to bottom, column by column).
Siddhant Dwivedi·Jul 2, 2025Trees Problem -1 (Level -Order Traversal)Welcome to my Tree Data Structure Series, where I explain one problem at a time in a simple and beginner-friendly way.
Ruben Lazarus·Dec 23, 2024Mastering Level Order Traversal in Rust: Code, Explanation, and Real-World ApplicationsLevel Order Traversal is a cornerstone algorithm in binary tree operations. If you’re working with hierarchical data, decision trees, or AI…
Pooja Rai·Nov 16, 2024Binary Tree Level Order TraversalGiven the root of a binary tree, return the level order traversal of its nodes’ values. (i.e., from left to right, level by level).
geetanjli gupta·Oct 29, 2024DSA: Binary Tree Level Order Traversalproblem link: https://leetcode.com/problems/binary-tree-level-order-traversal