EngeeMind: Sorting Visualizer

Topics

Home Study Tips Exam Prep Notes Career Technology Science Maths Languages About Contact

EngeeMind

Home Study Tips Exam Prep Notes Career Technology Science Maths Languages

Sorting Visualizer

Get link
Facebook
X
Pinterest
Email
Other Apps

By EngeeMind - August 11, 2026

Bottom Ad

Top Ad

Picks for You

100. Same Tree(leetcode)

Recursion Visualizer — isSameTree() Recursion Visualizer How isSameTree() Works Step through every recursive call, watch the call stack grow and shrink, and see how return values bubble back up. isSameTree.cpp 1 bool isSameTree ( TreeNode * p, TreeNode * q) { 2 if (p == nullptr || q == nullptr ) { 3 return p == q; 4 } 5 return (p->val == q->val) 6 && isSameTree (p->left, q->left) 7 && isSameTree (p->right, q->right); 8 } The Two Trees Being Compared Tree P root → p Tree Q root → q ↺ Reset ◀ Prev ▶ Play Next ▶ Step 0 / 0 Call Stack (most recent on top) in progress… Press “Next ▶” to begin the recursion… What's Ha...

Right/Left view of Binary Tree

Left & Right View of Binary Tree — Brute Force vs Optimal Left View & Right View · Brute Force vs Optimal · C++ What you see from the sides The left view of a binary tree is the set of nodes visible when looking at it from the left side — the first node at each level. The right view is the same from the right — the last node at each level. Two approaches: brute force (BFS + pick first/last) and optimal (DFS with level tracking). 01 · Brute: BFS tree 02 · Brute: Level order 03 · Brute: Pick edges 04 · Optimal: DFS tree 05 · Optimal: Left DFS 06 · Optimal: Right DFS 07 · Comparison 01 Brute Force — the tree and the idea Brute Force · O(N) time · O(N) space The brute force approach uses BFS (level-order traversal) to collect all nodes level by level, then simply picks the first element of each level for the left view and ...

Bottom view of a Binary Tree

Bottom View of Binary Tree — Step-by-Step Visualization Bottom View of a Binary Tree · BFS + Vertical Lines · C++ What do you see from the bottom ? Imagine looking up at the tree from below. Nodes aligned on the same vertical line overlap — only the lowest one is visible. This algorithm uses BFS to assign each node a "vertical position" and keeps overwriting the map so the last (deepest) node at each position wins. How vertical positions work The root is at vertical position 0 . Going left subtracts 1 ( line - 1 ); going right adds 1 ( line + 1 ). Nodes on the same vertical position form a column — like floors of a building seen from below. Why BFS + map = bottom view BFS visits nodes level by level (top to bottom). Each time a node is visited at a given vertical line, its value overwrites the previous one in the map. ...

Top view of a Binary Tree

Top View of Binary Tree — Visualizer Top-Down View Top View of a Binary Tree Imagine looking at the tree from above. You only see the first node at each vertical position. BFS guarantees the topmost node is discovered first — the map keeps only that one. Green = selected as top view Red dashed = blocked (vertical already taken) x = vertical position (left = -1, right = +1) top_view.cpp 1 map int , int > mpp; 2 queue pair Node *, int >> q; 3 q.push({root, 0 }); 4 while (!q.empty()) { 5 auto it = q.front(); q.pop(); 6 Node * node = it.first; 7 int line = it.second; 8 if (mpp.find(line) == mpp.end()) { 9 mpp[line] = node->data; 10 } 11 if (node->left) q.push({node->left, line - 1 }); 12 if (node->right) q.push({node->right, line + 1 }); 13 } 14 for ( auto it : mpp) ans.push_back(it.second); Tree wi...

Topics

Binary Tree2
Tree2

Search

About

EngeeMind

View my complete profile

Sidebar Ad

Study Blog · Powered by Blogger