Chapter 25.3, Problem 25.3.3CP

Program Plan Intro

Time complexity:

• Time complexity in computer science is the computational complexity of the program which means the total amount of time it takes to run the algorithm.
• It will assessed by counting the number of fundamental operations made by the algorithm.

Binary search tree:

Binary search tree is a tree; the nodes are sorted in the semantic order.

• Binary search tree has the shape of binary tree.
• Nodes in the binary search tree can have zero, one, or two children.
• In a binary search tree, any node value is greater than the left sub tree and lesser than the right sub tree.
  • Node without children is called a leaf or end node.
  • A node that does not have a superior node is called a root node.
  • Root node is the starting node.
• The binary search will be performed until finding a search node or reaching the end of the tree.