30/03/2023 8:56 am
Topic starter
Notifications
Clear all
Students’s Forum
2
Posts
3
Users
1
Likes
579
Views
0
What are Binary Trees?
2 Answers
1
30/03/2023 1:16 pm
The Binary tree means that the node can have maximum two children. Here, binary name itself suggests that ‘two’; therefore, each node can have either 0, 1 or 2 children.
0
31/03/2023 5:41 pm
Binary Tree is defined as a tree data structure where each node has at most 2 children. Since each element in a binary tree can have only 2 children, we typically name them the left and right child.
Binary Tree Representation
A Binary tree is represented by a pointer to the topmost node (commonly known as the “root”) of the tree. If the tree is empty, then the value of the root is NULL. Each node of a Binary Tree contains the following parts:
- Data
- Pointer to left child
- Pointer to right child
Basic Operation On Binary Tree:
- Inserting an element.
- Removing an element.
- Searching for an element.
- Traversing the tree.
