Loading lesson path
DSA
Trees focused on DSA Trees and related concepts.
The Tree data structure is similar to Linked Lists in that each node contains data and can be linked to other nodes.
A Binary Tree is a type of tree data structure where each node can have a maximum of two child nodes, a left child node and a right child node.
Pre-order Traversal is a type of Depth First Search, where each node is visited in a certain order. Read more about Binary Tree traversals in general here .
In-order Traversal is a type of Depth First Search, where each node is visited in a certain order. Read more about Binary Tree traversals in general here .
Post-order Traversal is a type of Depth First Search, where each node is visited in a certain order. Read more about Binary Tree traversals in general here .
To avoid the cost of all the shifts in memory that we get from using Arrays, it is useful to implement Binary Trees with pointers from one element to the next, just like Binary Trees are implemented…
A Binary Search Tree is a Binary Tree where every node's left child has a lower value, and every node's right child has a higher value.
The AVL Tree is a type of Binary Search Tree named after two Soviet inventors Georgy Adelson-Velsky and Evgenii Landis who invented the AVL Tree in 1962.