 |
A typical course would comprise about 10 chapters.
Each chapter contains about 5-10 topics.
Binary Tree
Introduction
A binary tree is a dynamic data structure.
It stores data in a non-linear method.
A binary tree consists of many nodes.
Each node consists of 3 main parts:
- data
- left pointer
- right pointer
One node can point to zero, one or maximum two other nodes.
A node that has no other "child" or does not have anything on the left and right of its pointer is known as a leaf node.
A is the root node.
B is a branch.
C,D,E are leaf nodes.
A is the parent (or ancestor) to B and E.
B and E are child (or decendant) to A
B and E are siblings to each other.
Available Quizzes
All topics can have more than one quiz which can be attempted as many times as you want. Results of quizzes are displayed immediately after it is tried.
All topics can be commented on by users/teachers.
User comments
No comments posted yet. |
Chapter: Binary Tree
The following topics would be clickable if you registered for the course: