🌳 Binary Trees in Java

This repository contains a comprehensive journey of learning and implementing Binary Trees in Java, starting from basic tree construction to solving advanced tree-based problems.

📌 Table of Contents

• Introduction
• Tree Construction
• Basic Operations
• Traversals
• Advanced Questions
  • 1. Kth Ancestor of a Node
  • 2. Transform to Sum Tree
  • 3. Lowest Common Ancestor (LCA)
  • 4. Print Kth Level Nodes
  • 5. Top View of Binary Tree
• How to Run
• Contributing
• License

---

📖 Introduction

A Binary Tree is a hierarchical data structure in which each node has at most two children: left and right. It is widely used in coding interviews and system design.

---

🌱 Tree Construction

• Creating nodes using a class Node
• Building tree manually or using array input
• Recursive tree builders

class Node {
    int data;
    Node left, right;

    Node(int val) {
        data = val;
        left = right = null;
    }
}