COMPUTER NETWORKING

Detailed explanation-1: -A binary tree 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. Every node (excluding a root) in a tree is connected by a directed edge from exactly one other node. This node is called a parent.

Detailed explanation-2: -A tree is a collection of entities called nodes . Nodes are connected by edges . Each node contains a value or data, and it may or may not have a child node . The first node of the tree is called the root .

Detailed explanation-3: -Structurally, a complete binary tree consists of either a single node (a leaf) or a root node with a left and right subtree, each of which is itself either a leaf or a root node with two subtrees. The set of all nodes underneath a particular node x is called the subtree rooted at x.

Detailed explanation-4: -A binary tree is a tree structure where each node has at most two children. Some data is stored at each node. Nodes with children are called interior nodes while nodes without children are called leaf nodes .