Pages

Monday, July 14, 2025

Inorder Traversal(Binary Tree) in C++

void inorder(Node* root) {

    if (root == NULL) return;       // ✅ base case handled

    inorder(root->left);            // 🡐 left

    cout << root->data << endl;     // 🡐 root

    inorder(root->right);           // 🡐 right

}


at

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)

remove duplicates from sorted array - two pointer approach (leetcode)

  class Solution {     public int removeDuplicates ( int [] nums ) {         // base case: return if array have no el.         if ( nums...

  • Reverse a string using Stack
     import java.util.*; // Push element at the bottom of stack class StackB {          public static String reverseString(String str) {        ...
  • Diamond Pattern problem in C++
      #include <iostream> using namespace std ; // quote- break down bigger problems into smaller problems // Diamond pattern - /* pseu...
  • Binary Search in C++ (Arrays Part)
      #include <iostream> using namespace std ; int binSearch ( int * arr, int n, int key) {     int st = 0 , end = n - 1 ;     w...