Object Oriented Programming with C++, Second Edition

SUMMARY

• When we define a tree such that a node can point to maximum two nodes (known as sub nodes), it is called binary tree
• A binary tree where left sub node value is less than that of the node and that of right sub node is larger than that of the node. Such tree is known as Binary Search Tree. It is useful in searching a given value quickly.
• LIFO stands for Last-In first-out data structure. The best known example is stack.
• Node is an individual element of a tree or linked list.
• Push is an operation to push an element on stack.
• Pop is an operation which picks a top of stack element.
• Stack is a LIFO (last-in first-out) data structure.
• Tree is a dynamic data structure. It consists of nodes. Here every node points to zero or more nodes.
• Queue ...