Data Structure - Binary Tree
Binary Tree Binary Tree is a non-linear and hierarchical data structure where each node has at most two children referred to as the left child and the right child. The topmost node in a binary tree is called the root, and the bottom-most nodes(having no children) are called leaves. Representation of Binary Tree Each node in a Binary Tree has three parts: · Data · Pointer to the left child · Pointer to the right child Terminologies in Binary Tree · Parent Node : A node that is the direct ancestor of a node(its child node). · Child Node : A node that is the direct descendant of another node (its parent). · ...