Bubble Sort:
Bubble sort is a sorting method which repeatedly exchanges various pairs of data items until they are in order.
Leaf of a Tree:
A terminal node is called a leaf.
Depth of tree:
The depth of a tree is a maximum number nodes in a branch of T.
Binary Search:
A binary search is a technique for quickly locating an item in a sequential list.
Binary Tree:
A binary tree is a finite set of nodes where each node contain a left pointer a right pointer and add a data element.
Difference between Copies and similar in a tree:
Binary tree T and T are said to be similar if they have the same structure or they have same node.
The tree are said to be copies if they are similar and if they have the same contents at corresponding nodes.
Bubble sort is a sorting method which repeatedly exchanges various pairs of data items until they are in order.
Leaf of a Tree:
A terminal node is called a leaf.
Depth of tree:
The depth of a tree is a maximum number nodes in a branch of T.
Binary Search:
A binary search is a technique for quickly locating an item in a sequential list.
Binary Tree:
A binary tree is a finite set of nodes where each node contain a left pointer a right pointer and add a data element.
Difference between Copies and similar in a tree:
Binary tree T and T are said to be similar if they have the same structure or they have same node.
The tree are said to be copies if they are similar and if they have the same contents at corresponding nodes.
No comments:
Post a Comment