1.7) Binary Tree Zig-Zag traversal (Spiral Form Traversal)
Spiral form traversal of a Binary Tree involves traversing the nodes level by level, alternating the direction between left to right and right to left. This creates a "zigzag" pattern…
1.6) Level Order traversal of a Binary Tree
Level Order traversal explores nodes level by level, visiting all nodes at a given level before moving to the next level. This traversal order is useful for tasks like breadth-first…
1.5) Post-Order traversal of a Binary Tree
Post-Order traversal visits nodes of a Binary Tree in the order: Left-Right-Root. This means you start by visiting the left child, then the right child, and finally the current node…
1.4) Pre-Order Traversal of Binary Tree
Pre-Order traversal visits nodes of a Binary Tree in the order: Root-Left-Right. This means you start by visiting the root, then move to the left child, and finally to the…
1.3) In-Order traversal of Binary Tree
In-Order traversal is a way of visiting all nodes of a Binary Tree following a specific order: Left-Root-Right. This means you start from the left child, then visit the root,…
1.2) Binary Tree
A Binary Tree is a type of data structure where each node can have at most two children. It's like a branching structure where each node has the potential to…
1.4) Is Subsequence or not?
Given two strings s and t, return true if s is a subsequence of t, or false otherwise. A subsequence of a string is a new string generated from the…
1.3) Counting Bits
Given a non-negative integer n, for every i (0 ≤ i ≤ n), calculate the number of 1's in their binary representation and return an array.
1.2) Fibonacci Number
The Fibonacci numbers are a sequence of numbers where each number is the sum of the two preceding ones, starting from 0 and 1. Given an integer n, find the…
Minimum Cost to Hire K Workers
There are N workers. The i-th worker has a quality quality and a minimum wage expectation wage. Now you want to hire exactly K workers to form a paid group.…