Data Structures and Algorithms in Python - Full Course (Part 4/7) смотреть онлайн

Welcome to the Complete Data Structures and Algorithms in Python Bootcamp. This is the most comprehensive course to help you ace your coding interviews and learn about Data Structures and Algorithms in Python. You will see 100+ Interview Questions done at the top technology companies such as Apple, Amazon, Google and Microsoft and how to face Interviews with comprehensive visual explanatory video materials which will bring you closer towards landing the tech job of your dreams!

The topics that are covered in this part course.

Section 20 - Cracking Stack and Queue Interview Questions (Amazon,Facebook, Apple, Microsoft)

Question 1 - Three in One

Question 2 - Stack Minimum

Question 3 - Stack of Plates

Question 4 - Queue via Stacks

Question 5 - Animal Shelter

Section 21 - Tree / Binary Tree

What is a Tree?

Why Tree?

Tree Terminology

How to create a basic tree in Python?

Binary Tree

Types of Binary Tree

Binary Tree Representation

Create Binary Tree (Linked List)

PreOrder Traversal Binary Tree (Linked List)

InOrder Traversal Binary Tree (Linked List)

PostOrder Traversal Binary Tree (Linked List)

LevelOrder Traversal Binary Tree (Linked List)

Searching for a node in Binary Tree (Linked List)

Inserting a node in Binary Tree (Linked List)

Delete a node from Binary Tree (Linked List)

Delete entire Binary Tree (Linked List)

Create Binary Tree (Python List)

Insert a value Binary Tree (Python List)

Search for a node in Binary Tree (Python List)

PreOrder Traversal Binary Tree (Python List)

InOrder Traversal Binary Tree (Python List)

PostOrder Traversal Binary Tree (Python List)

Level Order Traversal Binary Tree (Python List)

Delete a node from Binary Tree (Python List)

Entire Binary Tree (Python List)

Linked List vs Python List Binary Tree

Section 22 - Binary Search Tree

What is a Binary Search Tree? Why do we need it?

Create a Binary Search Tree

Insert a node to BST

Traverse BST

Search in BST

Delete a node from BST

Delete entire BST

Time and Space complexity of BST

Section 23 - AVL Tree

What is an AVL Tree?

Why AVL Tree?

Common Operations on AVL Trees

Insert a node in AVL (Left Left Condition)

Insert a node in AVL (Left Right Condition)

Insert a node in AVL (Right Right Condition)

Insert a node in AVL (Right Left Condition)

Insert a node in AVL (all together)

Insert a node in AVL (method)

Delete a node from AVL (LL, LR, RR, RL)

Delete a node from AVL (all together)

Delete a node from AVL (method)

Delete entire AVL

Time and Space complexity of AVL Tree

Section 24 - Binary Heap

What is Binary Heap? Why do we need it?

Common operations (Creation, Peek, sizeofheap) on Binary Heap

Insert a node in Binary Heap

Extract a node from Binary Heap

Delete entire Binary Heap

Time and space complexity of Binary Heap

#DataStructures #Algorithms #Python #Morioh

Note: If you have any copyright issue with the content used in our channel or you find something that belongs to you, before you claim it to Youtube, SEND US A MESSAGE and the respective content will be DELETED right away. Thanks for understanding.

◼️◼️◼️◼️◼️◼️◼️◼️◼️◼️◼️◼️◼️◼️
? Merchandise: https://www.moteefe.com/store/developer?cp=WP6JDT
? Social Network for Developers: https://morioh.com/