- Published on
Given a Binary Tree of nodes, you need to find all the possible paths from the root node to all the leaf nodes of the binary tree.
Tree
All Posts
- leetcode (15)
- array (14)
- dynamic-programming (6)
- geeksforgeeks (5)
- data-structures (4)
- sorting (4)
- hash-table (4)
- algorithms (3)
- two-pointers (3)
- machine-learning (3)
- ai (3)
tree (3)
- divide-and-conquer (2)
- stack (2)
- dfs (2)
- heap (2)
- quantum-computing (2)
- matrix (2)
- linked-list (1)
- math (1)
- graph (1)
- greedy-algorithm (1)
- binary-search (1)
- meta-learning (1)
- greedy (1)
- priority-queue (1)
- recursion (1)
- arrays (1)
- binary-search-tree (1)
- striver-dsa-sheet (1)
- prefix-sum (1)
- binary-tree (1)
- queue (1)
- monotonic-stack (1)
- Published on
Given a binary tree of size n, find its reverse level order traversal. ie- the traversal must begin from the last level.- Published on
You are given the root of a binary tree containing digits from 0 to 9 only. Each root-to-leaf path in the tree represents a number. For example, the root-to-leaf path 1 -> 2 -> 3 represents the number 123. Return the total sum of all root-to-leaf numbers. Test cases are generated so that the answer will fit in a 32-bit integer. A leaf node is a node with no children.