Grokking Data Structures & Algorithms for Coding Interviews

0% completed

​

Types of Tree

Types of Tree

Binary Trees

Binary trees are a type of tree where each node can have at most two children, commonly referred to as the left child and the right child. The structure of a binary tree makes it a fundamental and widely used data structure in computer science.

Example

In this example, "A" is the root node with two children, "B" ( the left child) and "C" ( the right child). "B" also has two children, "D" (left child) and "E" (right child). "C" also has two children, "F" (left child) and "G" (right child)

.....

.....

.....

Like the course? Get enrolled and start learning!
Paritosh Paliwal

Paritosh Paliwal

· 9 months ago

But it's now just a duplicate of previous section. seems like a mistake.

Show 1 reply
Rohit Bhanot

Rohit Bhanot

· 2 months ago

Can the content be updated to include BST section atleast as highlighted in previous comments. There are sections on BST traversals, operation and BST problems without any conceptual section on BST itself, so the reader has to understand the concept from somewhere and then come back again.