Operations on binary trees
The basic operation to be performed on a binary are listed in Table 8.1
|
S.No
|
Operation
|
Description
|
|
1
2.
3.
4.
5.
6.
7.
8.
|
Create
Make BT
Empty BT
Lchild
Rchild
Father
Brother (sibling)
data
|
It creates an empty binary tree.
It creates a new binary tree having a single node with data field set to some value.
It returns true of the binary tree is empty. Otherwise it returns false.
It returns a pointer to the left child of the node. If the node has no left child it returns the null pointer.
It returns a pointer to the right child of the node. If the node has no right child it returns the null pointer.
It returns a pointer to the father of the node. Otherwise returns the null pointer
It returns a pointer to the brother of the node. Otherwise returns the null pointer.
It returns the contents of the node.
|
Apart from these primitive operations other operations that can be applied to the binary tree are:
1. Tree traversal
2. Insertion of nodes
3. Deletion of nodes
4. Searching for the node
5. Copying the binary
Data Structure & Algorithms Assignment Help, Live Experts
Struggling with data structure problems? Data structure subject is quite tough to learn? Need quick assistance in data structure questions? ExpertsMind.com is right place for you where your search ends, We at ExpertsMind offer online data structure assignment help, data structure homework help and data structure and algorithms question's answers by best online support by qualified tutors.
ExpertsMind.com - Creation of Binary Tree Assignment Help, Creation of Binary Tree Homework Help, Creation of Binary Tree Assignment Tutors, Creation of Binary Tree Solutions, Creation of Binary Tree Answers, Binary Trees Assignment Tutors