Problems on Binary Tree Designing a Binary Search Tree with no NULLs A Binary Search Tree (BST) is usually implemented using NULLs in C or C++. This article explores an alternative approach of using placeholder nodes. Here the Binary Search Tree will be implemented in C++.
Data Structures Implementing a Binary Search Tree (BST) in C++ In this article, we have explained the idea of implementing Binary Search Tree (BST) from scratch in C++ including all basic operations like insertion, deletion and traversal.
Problems on Binary Tree Sum of k smallest elements in Binary Search Tree Given a binary search tree and a integer k our task is to find out sum of all the elements which is less or equal to the k th smallest element
Problems on Binary Tree Find k-th smallest element in Binary Search Tree Given root of the tree and k as input, output K th smallest element. We reduce the time complexity from O(N) to O(log N).
Problems on Binary Tree Algorithm to convert Binary Search Tree into Balanced Binary Search Tree In this article, we will explore an algorithm to convert a Binary Search Tree (BST) into a Balanced Binary Search Tree in linear time O(N).
Problems on Binary Tree Algorithm for finding minimum or maximum element in Binary Search TreeγO(log V) / O(V)γ Binary Search Tree is a node-based binary tree data structure and finding the maximum or minimum element take O(log N) in average and can take O(N) in the worst case to O(1) in the best case.
Problems on Binary Tree Understand everything about Binary Search Tree Binary search tree is a data structure that quickly allows us to maintain a sorted list of numbers in a tree data structure. It can be used to search for the presence of a number in O(log(n)) time and a simple traversal gives the numbers in sorted order.
