3207. Maximum Points After Enemy Battles
3207. Maximum Points After Enemy Battles
Description
You are given an integer array enemyEnergies denoting the energy values of various enemies.
3206. Alternating Groups I
863. All Nodes Distance K in Binary Tree
863. All Nodes Distance K in Binary Tree
Description
Given the root of a binary tree, the value of a target node target, and an integer k, return an array of the values of all nodes that have a distance k from the target node.
919. Complete Binary Tree Inserter
919. Complete Binary Tree Inserter
Description
A complete binary tree is a binary tree in which every level, except possibly the last, is completely filled, and all nodes are as far left as possible.
431. Encode N-ary Tree to Binary Tree
431. Encode N-ary Tree to Binary Tree
Description
Design an algorithm to encode an N-ary tree into a binary tree and decode the binary tree to get the original N-ary tree. An N-ary tree is a rooted tree in which each node has no more than N children. Similarly, a binary tree is a rooted tree in which each node has no more than 2 children. There is no restriction on how your encode/decode algorithm should work. You just need to ensure that an N-ary tree can be encoded to a binary tree and this binary tree can be decoded to the original N-nary tree structure.
1609. Even Odd Tree
1302. Deepest Leaves Sum
1161. Maximum Level Sum of a Binary Tree
1161. Maximum Level Sum of a Binary Tree
Description
Given the root of a binary tree, the level of its root is 1, the level of its children is 2, and so on.
958. Check Completeness of a Binary Tree
958. Check Completeness of a Binary Tree
Description
Given the root of a binary tree, determine if it is a complete binary tree.