Invert a Binary Tree in C, C++, Java & Python – Code with Explanation & Examples in Short and Simple

   

C Program

#include <stdio.h>
#include <stdlib.h>
typedef struct N { int d; struct N *l, *r; } N;
N* n(int d) {
    N* t = malloc(sizeof(N));
    t->d = d; t->l = t->r = NULL; return t;
}
void inv(N* r) {
    if (!r) return;
    N* t = r->l; r->l = r->r; r->r = t;
    inv(r->l); inv(r->r);
}
void pre(N* r) {
    if (!r) return;
    printf("%d ", r->d);
    pre(r->l); pre(r->r);
}
int main() {
    N* r = n(1);
    r->l = n(2); r->r = n(3);
    pre(r); printf("\n");
    inv(r);
    pre(r);
}

C Output

Input Tree (Preorder):
1 2 3

Inverted Tree (Preorder):
1 3 2

C++ Program

#include <iostream>
using namespace std;
struct N {
    int d; N *l, *r;
    N(int v): d(v), l(0), r(0) {}
};
void inv(N* r) {
    if (!r) return;
    swap(r->l, r->r);
    inv(r->l); inv(r->r);
}
void pre(N* r) {
    if (!r) return;
    cout << r->d << " ";
    pre(r->l); pre(r->r);
}
int main() {
    N* r = new N(4);
    r->l = new N(2); r->r = new N(7);
    pre(r); cout << endl;
    inv(r);
    pre(r);
}

C++ Output

Input Tree (Preorder):
4 2 7

Inverted Tree (Preorder):
4 7 2

JAVA Program

class N {
    int d; N l, r;
    N(int d) { this.d = d; }
}
public class Main {
    static void inv(N r) {
        if (r == null) return;
        N t = r.l; r.l = r.r; r.r = t;
        inv(r.l); inv(r.r);
    }
    static void pre(N r) {
        if (r == null) return;
        System.out.print(r.d + " ");
        pre(r.l); pre(r.r);
    }
    public static void main(String[] a) {
        N r = new N(10);
        r.l = new N(5); r.r = new N(15);
        pre(r); System.out.println();
        inv(r);
        pre(r);
    }
}

JAVA Output

Input Tree (Preorder):
10 5 15

Inverted Tree (Preorder):
10 15 5

Python Program

class N:
    def __init__(s, d): s.d, s.l, s.r = d, None, None
def inv(r):
    if r: r.l, r.r = inv(r.r), inv(r.l)
    return r
def pre(r):
    if r: print(r.d, end=' '); pre(r.l); pre(r.r)

r = N(6)
r.l = N(3); r.r = N(8)
pre(r); print()
inv(r)
pre(r)

Python Output

Input Tree (Preorder):
6 3 8

Inverted Tree (Preorder):
6 8 3

In-Depth Learning – Entire Concept in Paragraphs

What Is Linear Search?

Linear Search, or sequential search, is among the simplest search algorithms in programming. It tests every element of a list or array individually until it finds the target value or exhausts the list. It doesn't need to sort and can operate on sorted as well as unsorted arrays.

How the Code Works

We first read n (array size), x (target), and the array. We then loop over each element:

If we hit the element equal to x, we exit and return its index.

If we get to the end without finding a match, we return "Not Found".

In C and C++, the for loop gets to use a neat trick: for(i = 0; i < n && a[i] != x; i++); i.e., it gets to break the moment the element is encountered. In Python, we employ the in keyword along with .index() for a clean, readable implementation.

Example

Let's consider an example:

sql

Array: [4, 5, 10, 23, 42, 11]

Search for: 10

We begin from the start:

4 → Not 10

5 → Not 10

10 → Match found at index 2

So we return "Found at 2".

If the value is not in the list, we return "Not Found".

Real-Life Analogy

Picture looking for a name in a guest list where the names are not arranged. You begin from the top and work your way down one at a time. If you encounter the name, you stop. If you reach the bottom and the name is not there, you decide it's not in the list. That's linear search — straightforward, uncomplicated, and easy to understand.

This is how you'd search in real life when the data is not sorted or you don't know where the item could be.

When to Use Linear Search

Use Linear Search when:

The list is unsorted

The list is small

You require a simple and fast solution

You don't want binary search logic or data preparation overhead

It's commonly used in interview warm-up rounds, MCQs, logical reasoning sections, and introductory programming problems.

Time Complexity

Best Case: O(1) → item is at the start

Average Case: O(n/2)

Worst Case: O(n) → item is not found or is the final one

Python-Specific Benefit

Python has a straightforward mechanism for performing linear search through:

python

if x in a:

    print(a.index(x))

This does a presence check and returns its location — no loop required! But internally, it still does a linear search.

SEO-Optimized Natural Paragraph for Ranking

Want the simplest method of doing linear search in programming? This guide demonstrates how to carry out a basic linear search in C, C++, Java, and Python using concise and effective code samples. Linear search is a simple, easy technique to use in order to locate a value within an array without needing to sort. Whether you are practicing coding interviews, practising logic puzzles, or learning search algorithms, understanding linear search will give you a solid understanding of data structures and algorithmic thinking. With real-world examples and language-specific optimization advice, this is your one-stop guide to mastering linear search in whatever programming language you are using.