A tree whose elements have at most 2 children is called a binary tree. Since each element in a binary tree can have only 2 children, we typically name them the left and right child.
A Binary Tree node contains following parts.
Posted inProgramming & Data Structures
Binary Tree Data Structure
Posted by
1
1
Post navigation
Previous Post
C Program to Write a Sentence to a File
Comments are closed