In this tutorial, i am going to discuss what is binary tree preorder traversal? How to implement binary tree preorder traversal with and without recursion.
Given the root of a binary tree, write a code to return the preorder traversal of its nodes’ values.
In this post, I am going to discuss a very famous interview problem validate binary search tree or in other words check if a binary tree is BST or not.
Given the root of a binary tree, We have to write a code to check if it is a binary search tree (BST) or not.
The property of a valid binary search tree (BST) is:
i) The left subtree of a node contains only nodes with keys less than the node’s key.
ii) The right subtree of a node contains only nodes with keys greater than the node’s key.
iii) Both the left and right subtrees must also be binary search trees.
For example –
In this problem, We have given a non-empty array which represents a non-negative integer. Write a code to add one to the number.
Each element in the array contain a single digit. You may assume the integer does not contain any leading zero, except the number 0 itself.
Example 1 –
Input: [1, 3, 4]
Output: [1, 3, 5]
In this example, the array represents the number 134. When we add 1 to it, the new number is 135.
Example 2 –
Input : [1, 2, 9]
Output: [1, 3, 0]
The number is 129. When we add 1 to 129. The new number is 130.
Example 3 –
Input : [9, 9, 9]
Output: [1, 0, 0, 0]
For the number 999, when you add 1, the new number would be 1000. If you think in terms of array, the new array size would be the previous array size plus one.