Postfix expression evaluation using STACK | Data structure and algorithm | Very easy process - Liton's IT JOB and Study Care

Home
IT JOB Courses
Buy Books

Home
IT JOB Courses
Buy Books

৳ 0.00 0 Cart

Home
IT JOB Courses
Buy Books

Home
IT JOB Courses
Buy Books

৳ 0.00 0 Cart

Data Structure & Algorithm Basic to Advanced Course for CSE/IT Job Preparation Postfix expression evaluation using STACK | Data structure and algorithm | Very easy process

Data Structure & Algorithm Basic to Advanced Course for CSE/IT Job Preparation

0% Completed

Data Structure

Basic Operation of Data structure | Types of DS | data vs information | memory calculation

Video - 00:19:10 mins

Array related math solution | Row major & Column Major | Types of Array | Advantage of array

Video - 00:00:00 mins

Heap tree | Max heap construction | Min heap construction | max-min heap algorithm

Video - 00:00:00 mins

What is STACK | PUSH and POP algorithm | Implementation of STACK | Application of STACK

Video - 00:00:00 mins

Postfix expression evaluation using STACK | Data structure and algorithm | Very easy process

Video - 00:00:00 mins

Algorithm for infix to postfix expression using Stack | Stack implementation | with example

Video - 00:00:00 mins

Queue in Data Structure | Enqueue & Dequeue Operation | Complexity of Queue | Application of Queue

Video - 00:00:00 mins

Properties of Tree | Height, Depth, Level | Application of Tree | IT Job Solution | Data Structure

Video - 00:00:00 mins

Tree Traversing | Pre Order | In Order | Post Order | Data Structure | IT Job Solution

Video - 00:00:00 mins

Announcements Reviews Course Info

2026 © – Engr. Md. Liton Mia

About
Contact
Terms& Conditions
Privacy & Policy

Facebook Twitter Youtube Pinterest