Tree Data Structure

Last Updated: Nov 17, 2023

Contents

Implementation of BSTs

Walkthrough Examples:

VALIDBST INORDERNEXT

0/1

Examples

Next Greater Number BST

Tree Data Structure Problems

0/5

BST traversal

Valid BST from Preorder

Kth Smallest Element In Tree

2-Sum Binary Tree

Recover Binary Search Tree

0/3

Trie

Xor Between Two Arrays!

Shortest Unique Prefix

0/7

Simple tree ops

Path to Given Node

Remove Half Nodes

Nodes at Distance K

Last Node in a Complete Binary Tree

Consecutive Parent - Child

Balanced Binary Tree

Maximum Edge Removal

0/3

2 trees

Merge two Binary Tree

Symmetric Binary Tree

Identical Binary Trees

0/5

Tree construction

Construct BST from Preorder

Inorder Traversal of Cartesian Tree

Sorted Array To Balanced BST

Construct Binary Tree From Inorder And Preorder

Binary Tree From Inorder And Postorder

0/7

Traversal

Vertical Order traversal of Binary Tree

Diagonal Traversal

Vertical Sum of a Binary Tree

Covered / Uncovered Nodes

Inorder Traversal

Preorder Traversal

Postorder Traversal

0/5

level order

Right view of Binary tree

Cousins in Binary Tree

Reverse Level Order

ZigZag Level Order Traversal BT

Populate Next Right Pointers Tree

0/6

Root to leaf

Max Depth of Binary Tree

Sum Root to Leaf Numbers

Min Depth of Binary Tree

Root to Leaf Paths With Sum

0/1

Inplace Change

Invert the Binary Tree

0/1

Tree search

Least Common Ancestor

0/1

LinkedList tree

Flatten Binary Tree to Linked List

0/1

Segment Tree

Order of People Heights

Video Courses
By

View All Courses