Given the binary search tree, we need to find the Ceil value of given input data.
What is Ceil value ? The smallest value just greater than or equal to given input data. We have already discussed about Floor of input data in BST. The logical flow of ceil value in BST is exactly same as that floor value. Let us find Ceil value for BST shown in Fig 1.
Given a binary search tree (BST), find out the floorl value of input data using recursive algorithm. Traverse the binary
Given a binary search tree (bst), we would like to find out K smallest element in BST. Traverse the binary
Given the binary tree, we need to print the number which are in a given range. We will be given the two numbers K1 and K2, we need to print all numbers within the range of K1 and K2 ( number > k1 and number < k2).
Let us understand the problem statement. Given the number , we need to find the node in the binary tree having data equal to given number and we will delete the found node. Suppose we are given the tree as shown in Fig 1, we will analyse BST to delete a node.
Predecessor of any node is the previous node of binary traversal. Let us take an example to understand the inorder predecessor in binary search tree. We have already discussed about the inorder successor. The logical flow of inorder predecessor and inorder successor is same. If we understand any one of them, other can be solved in similar manner.
Successor of node is the next node of binary traversal. Let us take an example to understand the inorder successor in binary search tree. We have discussed about the inorder predecessor. The logical flow of inorder predecessor and inorder successor is same.
Lowest or least common ancestor is the earliest possible node where concerned child nodes joined.
Let us take an example tree, we will discuss some examples to clarify the LCA. We have already discussed about finding lowest common ancestor in binary tree (not binary search tree)
What is Binary Search Tree?
The binary search tree is specialized form of binary tree having following properties
Left child of binary tree node is less than its parent node
Right child of binary tree node is greater than its parent node
We are given the node value (or data), we need to find the node in the binary search tree. let us take a example to understand the problem statement.
What is Binary Search Tree?
The binary search tree is specialized form of binary tree having following properties
Left child of binary tree node is less than its parent node
Right child of binary tree node is greater than its parent node
