Trees and their Basic Properties!

Explore the fundamental properties and terminology of trees in data structures. Learn about nodes, edges, depth, height, and different tree types including binary, AVL, and Red-Black trees to build a solid understanding essential for coding interviews.

We'll cover the following...

Introduction

Introduction

Trees consist of vertices (nodes) and edges that connect them. Unlike the linear data structures that we have studied so far, trees are hierarchical. They are similar to Graphs, except that a cycle cannot exist in a Tree - they are acyclic. In other words, there is always exactly one path between any two nodes.

Root Node: A node with no parent nodes. Generally, trees don’t have to have a root. However, rooted trees have one distinguished node and are largely what we will use in this course.
Child Node: A Node which is linked to an upper node (Parent Node)
Parent Nodes: A Node that has links to one or more Child

...

1.Introduction to Complexity Measures

2.Introduction to Lists

3.Introduction to Linked Lists

4.Introduction to Stacks and Queues

5.Introduction to Graphs

6.Introduction to Trees

7.Trie

8.Introduction to Heap

9.Introduction to Hashing

10.Summary of Data Structures

Mock Interview

Trees and their Basic Properties!

Introduction