byr_wy的博客

Maximum Depth of N-ary Tree Given a n-ary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. Solution ""...

Merge Two Binary Trees Given two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are not. You need to merge them...

Fibonacci Number The Fibonacci numbers, commonly denoted F(n) form a sequence, called the Fibonacci sequence, such that each number is the sum of the two preceding ones, starting from 0 and 1. That i...

Binary Tree Preorder Traversal Given a binary tree, return the preorder traversal of its nodes’ values. Example Input: [1,null,2,3] Output: [1,2,3] Solution # Recursively class Solution: def p...

Binary Tree Postorder Traversal Given a binary tree, return the postorder traversal of its nodes’ values. Example Input: [1,null,2,3] Output: [3,2,1] Solution #Recursively class Solution: def ...