Category: Data Structure

Expression tree is also a binary tree in which the leafs terminal nodes or operands and non-terminal intermediate nodes are operators used for traversal.

Ø The manipulation of Arithmetic expression Ø Used for Searching Operation Ø Used to implement the file system of several popular operating systems Ø Symbol Table construction Ø Syntax analysis

Binary tree is used in data processing. a. File index schemes b. Hierarchical database management system

Two methods to implement a binary tree are, a. Linear representation. b. Linked representation

A Binary tree is a finite set of data items which is either empty or consists of a single item called root and two disjoin binary trees called left sub tree max degree of any node is two.

Nodes with the same parent are called siblings. The nodes with common parents are called siblings.

The length of the path is the number of edges on the path. In a tree there is exactly one path form the root to each node.

For any node n, the depth of n is the length of the unique path from the root to node n. Thus for a root the depth is always zero.

The height of n is the length of the longest path from root to a leaf. Thus all leaves have height zero. The height of a tree is equal to a height of a root.

Trees are non-liner data structure, which is used to store data items in a shorted sequence. It represents any hierarchical relationship between any data Item. It is a collection of nodes,          which has a distinguish node called the root and zero or more non-empty sub trees T1, T2,….Tk. each of which are connected by…