Does Siksha Sarovar have an AI chatbot to answer student doubts?

Yes. Siksha Sarovar has a built-in AI Assistant chatbot accessible from a floating button on every page. It understands English, Hindi and Hinglish, handles typos (for example 'pyhtion' or 'certifecate'), and indexes 165+ destinations including every course, lesson, BCA subject, school chapter, competitive exam topic, FAQ and tool. Most queries return direct link cards in under 5 milliseconds. An AI fallback is available for novel questions.

Can I ask the SikshaSarovar chatbot questions in Hindi or Hinglish?

Absolutely. The chatbot is built specifically for Indian students — natural Hinglish queries like 'kaise milega certificate', 'free hai kya', 'pyhtion ke datatype kaha hai', 'kaha se shuru karu' are first-class citizens. The matcher strips Hindi filler words and routes you to the right course, lesson or page.

Is the SikshaSarovar AI chatbot free to use?

Yes. The chatbot is 100% free, requires no signup, and is available on every page. It runs locally in your browser for the vast majority of queries — there is no API cost or usage limit. The optional 'Ask AI' fallback for advanced coding questions uses the Pro AI Tutor.

Is Siksha Sarovar really free?

Yes. Every course, lesson, quiz, online compiler, and notes download is free to use without an account. We offer an optional Pro pass that unlocks longer AI tutor sessions, larger compiler quotas and priority support, but it is not required to learn from the platform. The educational content itself stays free.

Do I need to sign in to use the courses?

No. You can browse any course, read all lessons, run code in the compiler and take quizzes without signing in. Google Sign-In is purely optional and is used only to save your progress, quiz scores and certificate eligibility across devices. We never request access to Gmail, Drive, Calendar, Contacts, or any sensitive Google data.

Are the certificates from Siksha Sarovar recognised?

Our certificates are a record of completion that you can share on LinkedIn or attach to applications, but Siksha Sarovar is an independent platform — not a UGC-recognised university or board. We are upfront about that. The certificate is most useful as a verifiable signal that you have completed the curriculum, not as a substitute for a degree.

Which courses are best for BCA and MCA students?

Our University Curriculum section covers the YMCA BCA/MCA syllabus subject-by-subject — Data Structures, DBMS, Web Based Programming, Computer Networks, Operating Systems, Software Engineering, Data Warehousing and more. Each subject is broken down into the same units your university teaches, with previous year question papers where available.

Can I use Siksha Sarovar to prepare for SSC, UPSC, Banking or Railway exams?

Yes. The Competitive section has dedicated tracks for SSC (CGL, CHSL, MTS), UPSC, IBPS/SBI Banking, RRB Railways and defence exams (NDA, CDS, AFCAT). Topics include quantitative aptitude, reasoning, English grammar, general knowledge and current affairs, written specifically for the Indian exam pattern.

What languages does the online compiler support?

The Siksha Sarovar online compiler supports C, C++, Python, Java, PHP, JavaScript, C# and SQL. The compiler runs your code in a sandboxed environment using Judge0, returns the standard output and error stream, and supports stdin so you can test interactive programs. There is no installation — everything runs in your browser.

How is my personal data handled by Siksha Sarovar?

We follow data minimisation: we collect only what is needed (email, name, profile picture from Google sign-in, and your learning progress). Data is stored on Supabase with HTTPS in transit. We do not sell user data, and we do not use it to train AI models. You can request deletion at any time by emailing contact@sikshasarovar.com — see our Privacy Policy for the full details.

Who founded Siksha Sarovar?

Siksha Sarovar was founded by Rohit Kumar, who serves as CEO and Head Developer. Rohit built the platform to provide free, structured education to students across India — covering programming courses, university notes, school study material and competitive exam preparation.

Unit 2: Trees - Terminology — Data Structure Notes

Introduction to Trees

Trees are Non-Linear, Hierarchical Data Structures where data is organized in parent-child relationships.

Real World Analogy: A computer file system. Root Drive (C:/) → Folders (Parents) → Sub-folders (Children).

Formal Definition: A Tree is a collection of nodes where one node is the Root, and the remaining nodes are partitioned into disjoint sub-trees.

Key Terminology

Term	Definition	Example
Root	Topmost node, ancestor of all	Node A in most diagrams
Edge	Connection between two nodes (N nodes = N-1 edges)	Line from Parent to Child
Parent	Node directly above another	A is parent of B
Child	Node directly below another	B is child of A
Leaf (Terminal)	Node with no children (Degree = 0)	Bottom-most nodes
Internal Node	Any node that is NOT a leaf	Has at least 1 child
Siblings	Nodes sharing the same parent	B and C if both children of A
Degree of Node	Number of children	Leaf = 0, Binary node = 0/1/2
Degree of Tree	Maximum degree among all nodes	Binary tree = 2
Level	Root = Level 0, children = Level 1, etc.	Distance from root
Height	Longest path from node to any leaf	Root height = tree height
Depth	Path length from Root to the node	Root depth = 0
Path	Sequence of nodes from one to another	A → B → D
Subtree	Any node and all its descendants	Rooted at any non-root node

Binary Trees: The Core Structure

Rule: Every node can have at most 2 children — the Left Child and the Right Child.

Binary Tree Types — Comparison

Type	Definition	Properties	Use Case
Full (Strict)	Every node has 0 or 2 children	No node with exactly 1 child	Expression trees
Complete	All levels filled except possibly last; last level filled left-to-right	Array representation efficient	Heaps
Perfect	All internal nodes have 2 children; all leaves at same level	Most symmetric binary tree	Theoretical analysis
Degenerate (Skewed)	Every node has only 1 child	Essentially a linked list	Worst-case BST
Balanced	Height difference between left/right ≤ 1 for every node	O(log n) operations guaranteed	AVL, Red-Black trees

Binary Tree Mathematical Properties

Property	Formula	Example (height h = 3)
Max nodes at level L	2^L	Level 3: 2³ = 8 nodes
Max total nodes (height h)	2^(h+1) - 1	2⁴ - 1 = 15 nodes
Min height for n nodes	⌊log₂(n)⌋	15 nodes: ⌊log₂(15)⌋ = 3
Leaf nodes in Full BT	(n + 1) / 2	15 nodes: 8 leaves
Internal nodes in Full BT	(n - 1) / 2	15 nodes: 7 internal
Edges	n - 1	15 nodes: 14 edges

Worked Example: Identify Tree Properties

           A          Level 0
         /   \
        B     C        Level 1
       / \     \
      D   E     F      Level 2
         / \
        G   H          Level 3

Property	Value
Root	A
Leaves	D, G, H, F
Internal Nodes	A, B, C, E
Height	3
Degree of Tree	2 (Binary)
Siblings of E	D
Depth of E	2
Height of B	2
Total Nodes	8
Total Edges	7
Is it Full?	No (C has only 1 child)
Is it Complete?	No (Level 2 not filled left-to-right)