🌟 MCA Gold Medalist 🌟 Star Educator 🌟Gate Qualified 🔴UGC NET qualified🌟BOOK published on LINUX ADMINISTRATION by kalyani publish

Nisha Mittal

In this course we 'll cover all whole important theory and Previous year questions of  Data Structure . Data structure is utmost important subject as per NTA NET computer science and GATE computer science

Prepare for UGC NET 2019 by watching our free online lessons covering UGC Net syllabus and also helping you solve Previous year question papers. Pursue your dream of JRF.

NTA-UGC-NET & SET Exams

Hindi

(Hindi ) Previous Year Questions on Data Structure for NTA NET

Introduction and Overview

Data Structures

Computer Science & Application

NET Exams

Ace the toughest competitive and government exams in India 

Test Preparation

In this course we will cover all important topics of Data structure for NTA NET computer science, KVS PGT aspirants.  Also here we 'll cover important theory from the examination point of view as well.

Data Structure course overview and tips to crack exam(in Hindi )

In thia lesson we are going to cover Data Structure important topics for NTA NET computer science i.e. Trees . Here you 'll understand Binary Tree, Binary Search Tree and Binary heap . Also here you will find difference between binary tree and Binary Search Tree .

Binary Tree , Binary Search Tree and Heap of Data Structure (in Hindi )

Stack and Queue related question of Data structure for NTA NET computer science, KVS PGT aspirants.

Stack and Queue related question ( in Hindi )

Data structure previous year Question with correct options for NTA NET computer science, UGC NET computer science, KVS PGT aspirants

Data Structure previous year Question (in Hindi )

In this lesson you will understand how to use post order and in order of Tree to find out pre order of Tree in data structure for UGC NET computer science aspirants

Learn in order and post order use to find pre order of Tree (in Hindi )

How to solve postfix expressions with the help of stack for NTA NET computer science

How to solve postfix expressions (in Hindi)

Learn to solve heap questions in an easy way

Heap related objective questions (in Hindi )

How to heapify a Max Heap after inserting a new element

Learn to add new element in a Heap (in Hindi )

Number of different binary trees possible with n nodes

Learn to Calculate Different Binary Trees with N Nodes (in Hindi)

Learn how to check a particular number in Binary Search Tree

How to Search a Number in Binary Search Tree (in Hindi )

In order Tranversal in short (in Hindi )

Post Order Free Tranversal (in Hindi )

Pre Order Tranversal (in Hindi )

Binary Tree Rules (in Hindi )

Evaluate expression (in Hindi )

Conversion (in Hindi )

In this lesson you will cover inorder Traversal of a given tree for NTA NET computer science , KVS PGT aspirants

Dec 2015 Inorder Tranversal (in Hindi )

In this lesson I 'll teach you stack operations

June 2016 stack Operation (in Hindi )

Learn to find minimum number gates in given Boolean expression after simplification for NTA NET computer science, KVS PGT aspirants, GATE computer science

How many Gates required after simplification of boolean expression (in Hindi)

NTA NET computer science examination previous year Question with solution

Consider max heap and insert an element (in Hindi )

Use in order and pre order to find post order (in Hindi)

What is the inorder traversal sequence of the resultant tree? (In Hindi )

What is the height of the binary search tree (in Hindi )

Which is correct in order traversal sequence(s) of binary search tree(s)?( In Hindi )

Find In order, post order and pre order (in Hindi )

Post order tranversal of tree is given, find in order of BST (in Hindi)

The resultant max heap ( in Hindi)

Which of the following binary trees has its inorder and preorder traversals given in Hindi

The order in which the nodes are visited during an in tree ( in Hindi )

Binary Search Tree (BST) stores values in the range 37 to 573( in Hindi )

The sequence of the value popped out is (in Hindi )

Which of the following permutation can be obtained in same order using stack( in Hindi )

The number of nodes in left and right subtree( in Hindi )

Queue operations (in Hindi )

Job sequence problem (in Hindi )

Max heap related question (in Hindi )

Binary Search tree left and right subtree child (in Hindi )

Binary Search tree (in Hindi )

Maximum number of nodes in a tree same post and pre order (in Hindi )

In this course Nisha Mittal will provide solutions of questions of hash function for NTA NET computer science examination

(Hindi) Hash Function for NTA NET (Computer Science)

In this course Nisha Mittal will provide solutions of NTA NET computer science 2018 paper 2. This Course is beneficial for  NTA-UGC NET  aspirants.

(Hindi) Computer Science December 2018 Solutions: NTA-UGC NET

In this course Nisha Mittal will provide solutions and detail related to Huffman coding topic for NTA UGC NET computer science

(Hindi) Huffman Coding for NTA NET Computer Science

I have done masters in computer science and also qualified HTET and NET

Divya Jindal

In this course, the educator is discussing time complexities of different data structure in easy way.. So that it would be suitable for learners to learn and attempt questions based on them

Lessons

39 lessons • 2h 19m

Invalid Date

NaN

Data Structure course overview and tips to crack exam(in Hindi )

Invalid Date

NaN

Binary Tree , Binary Search Tree and Heap of Data Structure (in Hindi )

Invalid Date

NaN

Stack and Queue related question ( in Hindi )

Invalid Date

NaN

Data Structure previous year Question (in Hindi )

Invalid Date

NaN

Learn in order and post order use to find pre order of Tree (in Hindi )

Invalid Date

NaN

How to solve postfix expressions (in Hindi)

Invalid Date

NaN

Heap related objective questions (in Hindi )

Invalid Date

NaN

Learn to add new element in a Heap (in Hindi )

Invalid Date

NaN

Learn to Calculate Different Binary Trees with N Nodes (in Hindi)

Invalid Date

NaN

How to Search a Number in Binary Search Tree (in Hindi )

+ See all lessons