Searching in Binary Search Tree
PublishedIn this post, I'm gonna be talking about how we can search for an element in a Binary Search Tree. It is very easy to search for an element in a Binary Search Tree, easier than even in an array. All you have to do is compare the element's value with ...
Richa Kiran
Binary Tree Traversal Methods
PublishedIn this article I'm gonna talk about the ways of traversal we can perform on Binary Trees. A node of a binary tree primarily consists of three components - it's own data (D) It's left child (L) It's right child (R) Consider a node to be the most b...
Richa Kiran
Insertion in a Binary Search Tree
PublishedA Binary Search Tree is a Tree in which each node has not more than two child nodes, and each of the child nodes are inserted in the tree based on a certain rule - the left child should have value less than the parent node and the right child should ...
Richa Kiran
Binary Tree Structure in C
PublishedBinary trees are a type of Tree data structure wherein each node has at-most 2 child nodes. We've already discussed about Tree data structure. So, in this article we're gonna talk about the implementation of Binary Trees in C. This is how a Binary T...
Richa Kiran
Abstract Data Types
PublishedTill now we've come across many different types of data structures. In this article I'm gonna be talking about a concept called Abstract Data Type. Primitive Data Types But before getting started with that, let's first talk about what we exactly mean...
Richa Kiran
Doubly Linked Lists
PublishedTill now we've talked about linked lists and the basic operations associated with it. But today we're gonna talk about linked lists only, but with a slight variation. In a linked list, traversal can be done one way(a node only had "next" co...
Richa Kiran
Stacks using linked lists
PublishedIn this article, we're gonna talk about stack implementation using linked lists. In my past few posts I've already talked about Linked list implementation and stacks. If you're not yet clear with those concepts, please check out the above links! So l...