Ctrlk

Introduction
Chapter 1 Combination and Permutation
Chapter 2 Binary Search & Sorted Array
Chapter 3 Binary Tree
Chapter 4 DFS & BFS
Chapter 5 Linked List
Chapter 6 Dynamic Programming
Chapter 7 Graph & Search
Chapter 8 Data Structure
Chapter 9 High Frequency
Post Chapter 1 String
Post Chapter 2 Math
Post Chapter 3 Array
Facebook
Amazon
All Chapters Summary
Core Java Interview Questions
Basics of Sorting
Behavior Questions

Powered by GitBook

On this page

Was this helpful?

Chapter 3 Binary Tree

Basics Traversals Ancestors Serialize and Deserialize LinkedList 与 Binary Tree 相互转换 Problem: Insert Node in a Binary Search Tree (LintCode)Problem: Search Range in Binary Search Tree (LintCode)Problem 257: Binary Tree Paths Problem 124: Binary Tree Maximum Path Sum Problem 129: Sum Root to Leaf Numbers Problem 173: Binary Search Tree Iterator Problem 298: Binary Tree Longest Consecutive Sequence Problem 199: Binary Tree Right Side View Problem 250: Count Univalue Subtrees Problem 96: Unique Binary Search Trees Problem 95: Unique Binary Search Trees II Problem 156: Binary Tree Upside Down Problem 366: Find Leaves of Binary Tree Problem 404: Sum of Left Leaves Problem 270: Closest Binary Search Tree Value Problem 333: Largest BST Subtree Problem 315: Count of Smaller Numbers After Self

PreviousProblem 374: Guess Number Higher or Lower NextBasics

Last updated 6 years ago

Was this helpful?