All Posts

You are given a **perfect binary tree** where all leaves are on the same level, and every parent has two children.

Given an integer `numRows`, return the first numRows of **Pascal's triangle**.

Given an integer array `nums` where the elements are sorted in **ascending order**, convert it to a **height-balanced** binary search tree.

Given two integer arrays `preorder` and `inorder` where `preorder` is the preorder traversal of a binary tree and `inorder` is the inorder traversal of the same tree, construct and return the binary tree.

I wish that blasted baby would stop crying!

The static method `Object.

Given the `root` of a binary tree, return its maximum depth.

金溪民方仲永，世隶耕。

git diff --name-status firstbranch.

飞来山上千寻塔，闻说鸡鸣见日升。