Tag feed

#2-tree-recursion

3 posts0 followers

Segment Tree-1

Jul 14, 2024 · 2 min read · Segment Tree Basic Node Divide With Segment Tree Node Numbering (Segment Tree) // build (node, begin, end) build (1, 1, N) { L = 2xN, R = (2xN) + 1 // Node Number Calculate mid = (begin + end) / 2 left = (L, begin, mid) left = (R, ...

Join discussion

AHAnower Hossainanower-hossain.com

0

Recursion & Backtracking

Jul 7, 2024 · 1 min read · 1-Recursion-Basic #include "bits/stdc++.h" using namespace std; void solve(int n) { if(n==0) return; solve(n-1); cout<< n << " "; } int main() { ios::sync_with_stdio(false); cin.tie(NULL); int n; cin>>n; solve(n); ...

Join discussion

#2-tree-recursion

Search Hashnode

#2-tree-recursion

Segment Tree-1

Recursion & Backtracking