Complete Tree: a binary tree in which every levelexcept possibly the lastis full and all nodes in the last level are as far left as possible A binary search tree, sometimes called BST, is a type of binary tree which maintains the property that the value in each node must be greater tha...
with elements allocated contiguous memory. Thanks to this contiguous allocation, accessing any array element occurs in constant time. Each array element is identified by a corresponding index number.
My aim with this repository is to share my knowledge and document my journey as I dive deep into the world of DSA. About Data Structures and Algorithms are the fundamentals of any programming language. Understanding these can be a major tool when it comes to solving complex problems. In ...
Perfect Binary Tree: a binary tree in which all interior nodes have two children and all leave have the same depth Complete Tree: a binary tree in which every levelexcept possibly the lastis full and all nodes in the last level are as far left as possible ...