Right View – All the nodes visible when viewed from the right side of a tree. Left View – All the nodes visible when viewed from the left side of a tree. Consider a simple example below. Notice the views. Consider another example below where the root node A does not have left subtree. Notice …
Read More Left and Right Views in a Binary TreeProperty: A binary tree is a Binary Search Tree when all elements to the left is lesser than the current node and the ones to the right are greater than that node. Simplest way to understand is when you print a left node, root and right node, you should get a sorted list based on property …
Read More Find whether Binary tree is a Binary Search TreeWe must always follow the below 2 points when deleting a node from Binary Search Tree: Delete the node. Retain the Binary Search Tree property. Consider the following scenarios that we encounter when deleting a node from a BST: Scenario 1: Deleting a leaf node or a childless node. This is certainly the easiest case …
Read More How to delete a node from Binary Search Tree