Binary Tree Types

Jul 27, 2022

--

Full Tree : A binary tree where every node has 0 or 2 children.

Complete Tree: If all levels are completely filled except possibly the last level and the last level has all keys as left as possible.

Perfect Tree: If all internal nodes have two children and all leaves are at same level.

Complete Binary Tree

svalak

Written by svalak

Passionate about problem solving; #VoraciousReader #MBTIEnthusiast #LovePsychology

More from svalak

[Linux Internals] Completely Fair Scheduling(CFS) — CPU Scheduler Algorithm

svalak

[Linux Internals] Completely Fair Scheduling(CFS) — CPU Scheduler Algorithm

Completely Fair Scheduling (CFS) is the default scheduler in the latest kernel versions since 2.6.23; elegant handling of I/O and CPU…

2 min readJul 4, 2022

--

1570. Dot Product of Two Sparse Vectors

svalak

1570. Dot Product of Two Sparse Vectors

Given two sparse vectors, compute their dot product.

1 min readJun 8, 2022

--

1

Leetcode#253. Meeting Rooms II

svalak

Leetcode#253. Meeting Rooms II

Given an array of meeting time intervals intervals where intervals[i] = [starti, endi], return the minimum number of conference rooms…

1 min readMay 2, 2022

--

[System Design]: Short polling vs Long polling vs Push vs WebSocket

svalak

[System Design]: Short polling vs Long polling vs Push vs WebSocket

Polling(Short Polling) : When client is simply asking the backend/service whether it has certain information and backend supposed to…

3 min readJul 17, 2022

--

See all from svalak

Recommended from Medium

Time Complexity and Space Complexity of DFS and BFS Algorithms

Tech Sauce

Time Complexity and Space Complexity of DFS and BFS Algorithms

In this post, we will analyze the time and space complexity for Depth First Search and Breadth First Search algorithms …

3 min readJun 6

--

Mastering the Two-Pointer Technique: A Guide to Solving Array Problems Efficiently

Architect Algos
in
ArchitectAlgos

Mastering the Two-Pointer Technique: A Guide to Solving Array Problems Efficiently

Unlock the Power of Two-Pointer Algorithms for Optimal Solutions to Common Array Problems

5 min readSep 6

--

Lists

Staff Picks

457 stories310 saves

Stories to Help You Level-Up at Work

19 stories229 saves

Self-Improvement 101

20 stories628 saves

Productivity 101

20 stories581 saves

Tree traversal

Jim Tseng

Binary Tree Traversal

4 Types of Tree Traversal Algorithms

3 min readMay 17

--

Binary Trees Explained

Kitana Toft

Binary Trees Explained

In this article we will review Binary Trees. Binary Trees are composed of nodes which have at most two pointers, which are referred to as…

3 min readJun 2

--

AdaBoost Algorithm and Python Implementation with Decision Stumps

Shaofeng Qin

AdaBoost Algorithm and Python Implementation with Decision Stumps

Motivation: Tree-based models usually tend to overfitting due to “outliers”. For example, as the number of input features grows larger and…

6 min readMar 31

--

Introduction to Arrays and Their Algorithms :

Ibrahim Lanre Adedimeji

Introduction to Arrays and Their Algorithms :

Arrays are fundamental data structures in computer science and programming. They provide a way to store and organize multiple elements of…

13 min readJun 5

--

See more recommendations

Help
Status
Writers
Blog
Careers
Privacy
Terms
About
Text to speech
Teams