RezloPrep

Interview PrepBinary Trees

0% read · 0 of 58 topics

Binary TreesDSA

Tree Traversal

0% read0 of 58 topics

1. Traversals0/7

Binary Tree Preorder TraversalSoon

Binary Tree Inorder TraversalSoon

Binary Tree Postorder TraversalSoon

Binary Tree Level Order TraversalSoon

Binary Tree Zigzag Level Order TraversalSoon

Binary Tree Right Side ViewSoon

Binary Tree Left Side ViewSoon

2. Basic Properties0/12

Maximum Depth of Binary TreeSoon

Minimum Depth of Binary TreeSoon

Count Complete Tree NodesSoon

Balanced Binary TreeSoon

Diameter of Binary TreeSoon

Maximum Width of Binary TreeSoon

Same TreeSoon

Symmetric TreeSoon

Subtree of Another TreeSoon

Children Sum Property in Binary TreeSoon

All Nodes Distance K in Binary TreeSoon

Minimum Time to Burn a Binary TreeSoon

3. Path Problems0/8

Path SumSoon

Path Sum IISoon

Path Sum IIISoon

Binary Tree Maximum Path SumSoon

Sum Root to Leaf NumbersSoon

Sum of Left LeavesSoon

Longest Univalue PathSoon

Root to Node Path in Binary TreeSoon

4. Lowest Common Ancestor0/3

Lowest Common Ancestor of a Binary TreeSoon

Lowest Common Ancestor of a Binary Search TreeSoon

Lowest Common Ancestor of Deepest LeavesSoon

5. Construction & Transformation0/7

Construct Binary Tree from Preorder and InorderSoon

Construct Binary Tree from Inorder and PostorderSoon

Serialize and Deserialize Binary TreeSoon

Flatten Binary Tree to Linked ListSoon

Convert Sorted Array to Binary Search TreeSoon

Convert Sorted List to Binary Search TreeSoon

Construct String from Binary TreeSoon

6. Tree Views & Special Traversals0/6

Boundary TraversalSoon

Top View of Binary TreeSoon

Bottom View of Binary TreeSoon

Vertical Order TraversalSoon

Diagonal TraversalSoon

Maximum Level Sum of a Binary TreeSoon

7. Advanced0/2

Binary Tree CamerasSoon

House Robber IIISoon

8. Binary Search Tree0/13

Search in a Binary Search TreeSoon

Ceil in a Binary Search TreeSoon

Floor in a Binary Search TreeSoon

Insert Into a Binary Search TreeSoon

Delete Node in a BstSoon

Kth Smallest Element in a BSTSoon

Validate Binary Search TreeSoon

Construct Bst from Preorder TraversalSoon

Inorder Successor in BstSoon

Binary Search Tree IteratorSoon

Two Sum IV Input Is a BstSoon

Recover Binary Search TreeSoon

Largest Bst in Binary TreeSoon

Binary Tree Preorder Traversal

This lesson is coming soon. Browse the rest of the Binary Trees syllabus in the sidebar.