To find the maximum and minimum in a binary tree is as simple as right and left. A binary search tree is comprised of the the top pointer, also known as the parent and additional nodes known as child nodes. The child nodes are referred to as the left child and the right child. The left nodes contain only keys that are less than the top node. The right nodes only contain keys that are more than the top node. So, to find the minimum key, you only have to transverse the leftmost side of the tree. Look to the rightmost side and you will find the maximum. If the tree is not balanced you will struggle to find the maximum and the minimum keys. This is why self balancing trees like AVL’s or red – black are a lot more effective than basic BST.(1)

Binary Search Tree with key insert order of 1,2,3,4,5,6,7

1

/

2 3

/ /

4 5 6 7

The output of a BFS traversal in this binary search tree above is:

1

2,3

4,5,6,7

1. https://www.freecodecamp.org/news/binary-search-trees-bst-explained-with-examples/

B. Please comment to Armstrong A on this comment he made in 137 words.

The maximum and minimum Binary Search Tree is a Binary Tree with two additional properties. These properties are Nodes to the left of the root are lesser than the root node and the nodes to the right of the root node are greater than the root node.

In finding the maximum, start moving from root node and keep moving to the right node. In Binary Search Tree, we can find maximum by traversing right pointers until we reach the rightmost node. the data of all the nodes in the right sub-tree of the root node should be greater than or equals to the data of the root.

The rightmost thus obtained is the maximum of the BST. In finding the minimum, start from node and keep moving left to reach the leftmost node. In Binary Search Tree, we can find maximum by traversing right pointers until we reach the rightmost node. the data of all the nodes in the right sub-tree of the root node should be greater than or equals to the data of the root.. This leftmost node is the minimum of BST.

The output of a BFS traversal in a normal binary search tree if the key insert order is “1,2,3,4,5,6,7”, there are total 7 nodes in the given Binary search tree and also these entries are sorted in ascending order so the bfs traversal will be same as the input value i.e “1,2,3,4,5,6,7”