Question

explain the binary and spanning tree

Answer 1

RĀM RĀM jĪ ♥♥

ĀñswĒR ⏬⏬

⭕ BINARY TREE :
A binary tree is a tree data structure where each node has up to two child nodes, creating the branches of the tree.

◽A binary tree is made up of at most two nodes, often called the left and right nodes, and a data element. 

◽They are also often used for sorting data as in a heap sort.

⭕ SPANNING TREE :
A spanning tree is a subset of Graph G, which has all the vertices covered with minimum possible number of edges.

◽A maximum spanning tree is a spanning tree of weighted graphaving maximum weight. 
____________________________________________________✌✌✌

#NAVI HARYANVI ♥♠

Answer 2

Spanning tree is a kind of computer language like the binary and it follows a graph of G.

this graph G has all its vertices covered by a minimum number of edges. It is usually disconnected and do not form a cycle.

Binary on the other hand is a language that operates with only numbers from 0-9.

A programme is contructed by using this number and when the programme is run the computer follows the instruction.