filmov
tv
Binary Tree Part 1 | BST | Binary Search Tree - Data Structures & Algorithms Tutorials In Python #10
Показать описание
Binary tree is a special case of a general tree where you can have maximum 2 children for any given node. They are useful in implementing set/map class in different programming languages. They provide efficient way of search an element in log n complexity. There are various traversal schemes you can use such as breadth first search and depth first search. In depth first search you can use in order traversal, pre order traversal and post order traversal schemes that will benefit in different scenarious. For example in order traversal gives you a sorted list of elements in a tree. After going through theory we will implement binary tree, rather binary search tree in python. Binary search tree is also known as BST that is basically a binary tree with some order of elements.
Topics
00:00 Introduction
00:41 What problem does binary tree solve?
01:39 Binary tree & BST
06:46 Binary tree traversal schemes
07:23 In order, pre order, post order traversal
09:59 Python implementation
23:38 Exercise
#datastructures #algorithms #python #binarytree #treedatastructures #binarytreedatastructures
#️⃣ Social Media #️⃣
Topics
00:00 Introduction
00:41 What problem does binary tree solve?
01:39 Binary tree & BST
06:46 Binary tree traversal schemes
07:23 In order, pre order, post order traversal
09:59 Python implementation
23:38 Exercise
#datastructures #algorithms #python #binarytree #treedatastructures #binarytreedatastructures
#️⃣ Social Media #️⃣
Комментарии