Binary Tree Data Structure *_* A tree whose elements have at most 2 children is called a binary tree. It is made of nodes, where each node contains a 'left' reference, a 'right' reference, and a data element. The topmost node in the tree is called the root. Nodes which are not leaves are called internal nodes. Nodes with the same parent are called siblings. Binary Tree is a special data structure used for data storage purposes. It has the benefits of both an ordered array and a linked list as search is as quick as in a sorted array and insertion or deletion operation are as fast as in a linked list. A Binary Tree node contains the following parts. * Data * Pointer to left child * Pointer to the right child - Study24x7
Social learning Network
study24x7

Default error msg

Login

New to Study24x7 ? Join Now
Already have an account? Login
72 followers study24x7 07 Jun 2019 02:16 AM study24x7 study24x7

Binary Tree Data Structure *_* A tree whose elements have at most 2 children is called a binary tree. It is made of nodes, where each node contains a "left" reference, a "right" reference, and a data element. The topmost node in the tree is called the root. Nodes which are not le...

See more

Binary Tree Data Structure
*_* A tree whose elements ...
study24x7
Write a comment
Related Questions
500+   more Questions to answer
Most Related Articles