Reverse Level Order Tree Traversal - Coding problem | OneNoughtOne
Loading content...
Data Structures & Algorithms Patterns
0/364 completed
Chapter 1: Two Pointers Techniques
0/2
0/30
0/1
What Is an Array? — The Fundamental Collection
4
Array Memory Model & Contiguous Storage
4
In-Place Unique Elements
In-Place Unique Elements
Filter Array By Value
Limit Element Occurrences in Sorted Array
Relocate Zeroes to End
Maximum Water Container
Triplet Nearest Sum
Sorted Array Pair Search
Integer Square Verification
Perfect Square Pair Sum
Sorted Squares
Maximum Pair Sum Below Threshold
Count Pairs Below Threshold
Rainfall Basin Accumulation
Rescue Vessel Allocation
Cyclic Chain Detection
Circular List Entry Point
Rearrange Linked List
Symmetric Linked List
Linked List Center Node
Remove Central Node from Linked List
Tri-Value Partition
Wave Pattern Rearrangement
Array Element Ordering
Common Elements with Frequency
Smallest Shared Element in Sorted Arrays
Maximum Symmetric Substring
Minimum Palindrome Splits
Symmetric Substring Count
Triple Palindrome Partition
Optimal Disjoint Palindrome Selection
Chapter 2: Sliding Window Patterns
0/2
0/21
0/1
Chapter 3: Binary Search Techniques
0/2
0/18
0/1
Chapter 4: Array & String Manipulation
0/37
0/1
Chapter 5: Stack-Based Patterns
0/2
0/13
0/1
Chapter 6: Linked List Patterns
0/2
0/6
0/1
Chapter 7: Heap & Priority Queue
0/2
0/6
0/1
Chapter 8: Tree Traversal & Manipulation
0/2
0/39
0/1
Why Trees? Limitations of Linear Structures
4
Tree Properties — Height, Depth, Levels
4
Layer-by-Layer Binary Tree Values
Layer-by-Layer Binary Tree Values
Alternating Level Traversal
Binary Tree Height
Reverse Level Order Tree Traversal
Shortest Path to Tree Leaf
Rightmost Level Nodes
Multi-Child Tree Layer Traversal
Maximum Value Per Binary Tree Level
Level Mean Values
Peak Depth Value in Tree
Lowest Level Node Aggregation
Binary Tree Longest Path
N-ary Tree Height
Identical Binary Trees
Mirror Tree Validation
Height-Balanced Tree Verification
Embedded Tree Detection
Mirror Equivalent Binary Trees
Rebuild Binary Tree from Preorder and Inorder Traversals
Reconstruct Tree from Preorder and Postorder Sequences
Verify BST Integrity
Restore Corrupted Binary Search Tree
BST Rank Finder
BST Most Frequent Values
Closest Value Gap in Search Tree
Smallest Value Gap in Binary Search Tree
Ascending BST Reorganization
Binary Tree Bounded Sum
Inorder Tree Values
Target Sum Paths
Aggregate Path Numbers in Binary Tree
Tree Root-to-Leaf Paths
Lexicographically Minimal Leaf-to-Root String
Rearrangeable Palindrome Root-to-Leaf Paths
Optimal Tree Route Sum
Tree Balance Metric
Maximum Uniform Path
Tree Column Traversal
Columnar Tree Traversal
Chapter 9: Graph BFS Patterns
0/2
0/27
0/1
Chapter 10: Graph DFS & Advanced Patterns
0/2
0/30
0/1
Chapter 11: Greedy Algorithms
0/2
0/28
0/1
Chapter 12: Backtracking Patterns
0/2
0/23
0/1
Chapter 13: Dynamic Programming Fundamentals
0/2
0/13
0/1
Chapter 14: Advanced Dynamic Programming
0/18
0/1
Chapter 15: Bit Manipulation
0/2
0/12
0/1
Transfer patterns to a repository
0/2
Course overview & roadmap
Toggle Sidebar
101
OneNoughtOne
0/364
Share