BINARY TREE DATA STRUCTURE 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. PARTS OF NODE IN BINARY TREE : 1. Data, 2. Pointer to left child, and 3. Pointer to right child. THE USED FROM BINARY TREE ARE FOLLOWING : 1. Manipulate hierarchical data, 2. Make information easy to search, 3. Manipulate sort list of data, 4. Composting digital images for visual effect, 5. Router Algorithms, and 6. Form of a multi-stage decision-making (see business chess). TREE’S PART 1. ...