explain binary tree??
Answers
Answered by
0
Answer:
A binary tree is either empty or consists of a node called the root together with two binary trees called the left subtree and the right subtree. ... The nodes of a binary tree can be numbered in a natural way, level by level, left to right.
Answered by
0
In computer science, a binary tree is a tree data structure in which each node has at most two children, which are referred to as the left child and the right child. ... It is also possible to interpret a binary tree as an undirected, rather than a directed graph, in which case a binary tree is an ordered, rooted tree.
Similar questions