最新 最热

第四篇排序算法|二分查找

现在回过头来想想学生时代的课程,可谓是用贬义词来形容,是自己的问题还是教学本身存在的问题,还是留给自己去思考和消化吧,因为每个人的故事都很不同。...

2020-10-27
0

PAT (Advanced Level) Practice 1147 Heaps (30 分)

In computer science, a heap is a specialized tree-based data structure that satisfies the heap property: if P is a parent node of C, then the key (the value) of...

2020-09-28
1

Tree - 144. Binary Tree Preorder Traversal

Given a binary tree, return the preorder traversal of its nodes' values.

2020-09-23
1

Tree - 94. Binary Tree Inorder Traversal

Given a binary tree, return the inorder traversal of its nodes' values.

2020-09-23
1

Tree - 230. Kth Smallest Element in a BST

Given a binary search tree, write a function kthSmallest to find the kth smallest element in it.

2020-09-23
0

Tree - 96. Unique Binary Search Trees

96. Unique Binary Search TreesGiven n, how many structurally unique BST's (binary search trees) tha

2020-09-23
1

Tree - 113. Path Sum II

Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.

2020-09-23
1

Tree - 107. Binary Tree Level Order Traversal II

107. Binary Tree Level Order Traversal II

2020-09-23
1

Tree - 103. Binary Tree Zigzag Level Order Traversal

103. Binary Tree Zigzag Level Order Traversal

2020-09-23
1

Tree - 101. Symmetric Tree

Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).

2020-09-23
0