The infix string require to store in linked List using following structure typedef enum TokenType { Number, Identifier, Symbol } TokenType; typedef union Token { int number; char *identifier; char symbol; } Token; typedef struct ListNode *List; typedef struct ListNode { TokenType tt; Token t; List next; } ListNode; Expression Tree with following structure typedef struct ExpTreeNode *ExpTree; typedef struct ExpTreeNode { TokenType tt; Token t; ExpTree left; ExpTree right; } ExpTreeNode; Write a C program to convert infix string into an expression tree. The infix string includes numbers, identifiers and symbols
Types of Linked List
A sequence of data elements connected through links is called a linked list (LL). The elements of a linked list are nodes containing data and a reference to the next node in the list. In a linked list, the elements are stored in a non-contiguous manner and the linear order in maintained by means of a pointer associated with each node in the list which is used to point to the subsequent node in the list.
Linked List
When a set of items is organized sequentially, it is termed as list. Linked list is a list whose order is given by links from one item to the next. It contains a link to the structure containing the next item so we can say that it is a completely different way to represent a list. In linked list, each structure of the list is known as node and it consists of two fields (one for containing the item and other one is for containing the next item address).
The infix string require to store in linked List using following structure
typedef enum TokenType {
Number,
Identifier,
Symbol
} TokenType;
typedef union Token {
int number;
char *identifier;
char symbol;
} Token;
typedef struct ListNode *List;
typedef struct ListNode {
TokenType tt;
Token t;
List next;
} ListNode;
Expression Tree with following structure
typedef struct ExpTreeNode *ExpTree;
typedef struct ExpTreeNode {
TokenType tt;
Token t;
ExpTree left;
ExpTree right;
} ExpTreeNode;
Write a C program to convert infix string into an expression tree. The infix string includes numbers, identifiers and symbols
Step by step
Solved in 2 steps
