IT magazine

Applications of Stack Data Structure

Infix to Postfix or Infix to Prefix Conversion: The stack can be used to convert some infix expression into its postfix equivalent, or pref...

A binary expression tree is a specific kind of a binary tree used to represent expressions. Two common types of expressions that a binar...

Binary search tree is a data structure that quickly allows us to maintain a sorted list of numbers. It is called a binary tree becaus...

Java implementation of Binary Tree Traversals In order to implement the binary tree traversals recursive methods are used ...

Traversal is a process to visit all the nodes of a tree and may print their values too. Because, all nodes are connected via edges (li...

Applications of binary trees Binary Search Tree - Used in many search applications where data is constantly entering/leaving, ...

Binary Tree Representation : Binary trees can be represented in in two ways. 1. Sequential or Array representation. 2. ...